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 journal › Conference article › peer-review

Fingerprint

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

Mathematics

Computer Science