Sciweavers

WCC
2005
Springer

Frequency/Time Hopping Sequences with Large Linear Complexities

13 years 9 months ago
Frequency/Time Hopping Sequences with Large Linear Complexities
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk ) by taking successive k-tuples of given sequences over GF(p). We are able to characterize those p-ary sequences whose k-tuple versions now over GF(pk ) have the maximum possible linear complexities (LCs). Next, we consider the FH/TH sequence generators composed of a combinatorial function generator and some buffers. We are able to characterize the generators whose output FH/TH sequences over GF(pk ) have the maximum possible LC for the given algebraic normal form.
Yun-Pyo Hong, Hong-Yeop Song
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where WCC
Authors Yun-Pyo Hong, Hong-Yeop Song
Comments (0)