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 language | English |
|---|---|
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| Publication status | Published - 2002 Sep 12 |
| Event | 2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland Duration: 2002 Jun 30 → 2002 Jul 5 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics
Cite this
}
Linear complexity of sequences over arbitrary symbols and constructions of sequences over GF(pk) 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, 12.09.2002.Research output: Contribution to journal › Conference article
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 -