Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Hong, Y. P., & Song, H. Y. (2006). Frequency/time hopping sequences with large linear complexities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3969 LNCS, pp. 386–396). Springer Verlag. https://doi.org/10.1007/11779360_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
