By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yun-Pyo Hong ; Dept. of Electr. & Electron. Eng., Yonsei Univ., Seoul, South Korea ; Yu-Chang Eun ; Jeong-Heon Kim ; Hong-Yeop Song

We propose an appropriate approach of defining the linear complexity of sequences over an 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 respect to any basis. This leads to a construction of pk-ary sequences whose characteristic polynomial is essentially over GF(p).

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference: