Frequency/time hopping sequences with large linear complexities

Yun Pyo Hong, Hong Yeop Song

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationCoding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers
PublisherSpringer Verlag
Pages386-396
Number of pages11
ISBN (Print)3540354816, 9783540354819
DOIs
Publication statusPublished - 2006
EventInternational Workshop on Coding and Cryptography, WCC 2005 - Bergen, Norway
Duration: 2005 Mar 142005 Mar 18

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3969 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherInternational Workshop on Coding and Cryptography, WCC 2005
Country/TerritoryNorway
CityBergen
Period05/3/1405/3/18

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Frequency/time hopping sequences with large linear complexities'. Together they form a unique fingerprint.

Cite this