Linear complexity of sequences over arbitrary symbols and constructions of sequences over GF(pk) whose characteristic polynomial is over GF(p)

Yun Pyo Hong, Yu Chang Eun, Jeong Heon Kim, Hong Yeop Song

Research output: Contribution to journalConference article

Abstract

We propose an appropriate approach of defining the LC of sequences over unknown symbol set. We are able to characterize those p-ary sequences whose k-tuple versions now over GF(pk) have the same characteristic polynomial as the original with repect to any basis. This leads to a construction of pk-ary sequences whose characteristic polynomial is essentially over GF(p).

Original languageEnglish
Pages (from-to)468
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 2002
Event2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland
Duration: 2002 Jun 302002 Jul 5

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Linear complexity of sequences over arbitrary symbols and constructions of sequences over GF(p<sup>k</sup>) whose characteristic polynomial is over GF(p)'. Together they form a unique fingerprint.

  • Cite this