DocumentCode :
2521108
Title :
Linear complexity of prime n-square sequences
Author :
Kim, Young-Joon ; Song, Hong-Yeop
Author_Institution :
Sch. of Electr. & Electron. Eng., Yonsei Univ., Seoul
fYear :
2008
fDate :
6-11 July 2008
Firstpage :
2405
Lastpage :
2408
Abstract :
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 pn.
Keywords :
polynomials; sequences; linear complexity; minimal polynomial; prime n-square sequences; Autocorrelation; Binary sequences; Polynomials; Positron emission tomography; Zinc; Linear complexity; minimal polynomial; prime n-square sequences;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location :
Toronto, ON
Print_ISBN :
978-1-4244-2256-2
Electronic_ISBN :
978-1-4244-2257-9
Type :
conf
DOI :
10.1109/ISIT.2008.4595422
Filename :
4595422
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2521108
بازگشت