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
Publication statusPublished - 2006 Jan 1
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
CountryNorway
CityBergen
Period05/3/1405/3/18

Fingerprint

Function generators
Linear Complexity
Generator
Normal Form
Buffer
Output

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Hong, Y. P., & Song, H. Y. (2006). Frequency/time hopping sequences with large linear complexities. In Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers (pp. 386-396). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3969 LNCS). Springer Verlag.
Hong, Yun Pyo ; Song, Hong Yeop. / Frequency/time hopping sequences with large linear complexities. Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers. Springer Verlag, 2006. pp. 386-396 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{834562fc6ddc4ddb80690aac7fc77c82,
title = "Frequency/time hopping sequences with large linear complexities",
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.",
author = "Hong, {Yun Pyo} and Song, {Hong Yeop}",
year = "2006",
month = "1",
day = "1",
language = "English",
isbn = "3540354816",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "386--396",
booktitle = "Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers",
address = "Germany",

}

Hong, YP & Song, HY 2006, Frequency/time hopping sequences with large linear complexities. in Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3969 LNCS, Springer Verlag, pp. 386-396, International Workshop on Coding and Cryptography, WCC 2005, Bergen, Norway, 05/3/14.

Frequency/time hopping sequences with large linear complexities. / Hong, Yun Pyo; Song, Hong Yeop.

Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers. Springer Verlag, 2006. p. 386-396 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3969 LNCS).

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

TY - GEN

T1 - Frequency/time hopping sequences with large linear complexities

AU - Hong, Yun Pyo

AU - Song, Hong Yeop

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33746758873&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746758873&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33746758873

SN - 3540354816

SN - 9783540354819

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 386

EP - 396

BT - Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers

PB - Springer Verlag

ER -

Hong YP, Song HY. Frequency/time hopping sequences with large linear complexities. In Coding and Cryptography - International Workshop, WCC 2005, Revised Selected Papers. Springer Verlag. 2006. p. 386-396. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).