Frequency/Time hopping sequences with large linear complexities

  • Authors:
  • Yun-Pyo Hong;Hong-Yeop Song

  • Affiliations:
  • Coding and Information Theory Lab., CITY – Center for Information Technology of Yonsei University;Coding and Information Theory Lab., CITY – Center for Information Technology of Yonsei University

  • Venue:
  • WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.