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

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

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

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Conference article › peer-review

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(p^k) have the same characteristic polynomial as the original with repect to any basis. This leads to a construction of p^k-ary sequences whose characteristic polynomial is essentially over GF(p).

Original language	English
Pages (from-to)	468
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
Publication status	Published - 2002
Event	2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland Duration: 2002 Jun 30 → 2002 Jul 5

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",

language = "English",

pages = "468",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2002 IEEE International Symposium on Information Theory ; Conference date: 30-06-2002 Through 05-07-2002",

}

Linear complexity of sequences over arbitrary symbols and constructions of sequences over GF(p^k) whose characteristic polynomial is over GF(p). / Hong, Yun Pyo; Eun, Yu Chang; Kim, Jeong Heon; Song, Hong Yeop.

In: IEEE International Symposium on Information Theory - Proceedings, 2002, p. 468.

Research output: Contribution to journal › Conference article › peer-review

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

Y1 - 2002

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

SP - 468

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

T2 - 2002 IEEE International Symposium on Information Theory

Y2 - 30 June 2002 through 5 July 2002

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this