TY - GEN

T1 - Linear complexity of prime n-square sequences

AU - Kim, Young Joon

AU - Song, Hong Yeop

PY - 2008

Y1 - 2008

N2 - We review prime n-square sequences of length pn which is originally defined by Ding and Helleseth in 1998, where p is an odd prime and n is a positive integer. In this paper, we determine the linear complexity and the minimal polynomial of these sequences for any n. It turned out that these sequences have linear complexity that is of the order of the period p n.

AB - We review prime n-square sequences of length pn which is originally defined by Ding and Helleseth in 1998, where p is an odd prime and n is a positive integer. In this paper, we determine the linear complexity and the minimal polynomial of these sequences for any n. It turned out that these sequences have linear complexity that is of the order of the period p n.

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

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

U2 - 10.1109/ISIT.2008.4595422

DO - 10.1109/ISIT.2008.4595422

M3 - Conference contribution

AN - SCOPUS:52349114572

SN - 9781424422579

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2405

EP - 2408

BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008

T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008

Y2 - 6 July 2008 through 11 July 2008

ER -