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
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 2002 Sep 12
Event2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland
Duration: 2002 Jun 302002 Jul 5

Fingerprint

Linear Complexity
Characteristic polynomial
Polynomials
Arbitrary
Unknown

All Science Journal Classification (ASJC) codes

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

Cite this

@article{dfb0027fae8a4a3a8cda7845a005d635,
title = "Linear complexity of sequences over arbitrary symbols and constructions of sequences over GF(pk) whose characteristic polynomial is over GF(p)",
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).",
author = "Hong, {Yun Pyo} and Eun, {Yu Chang} and Kim, {Jeong Heon} and Song, {Hong Yeop}",
year = "2002",
month = "9",
day = "12",
language = "English",
journal = "IEEE International Symposium on Information Theory - Proceedings",
issn = "2157-8095",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

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

AU - Hong, Yun Pyo

AU - Eun, Yu Chang

AU - Kim, Jeong Heon

AU - Song, Hong Yeop

PY - 2002/9/12

Y1 - 2002/9/12

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

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

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

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

M3 - Conference article

AN - SCOPUS:0036353515

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

ER -