DocumentCode :
2055289
Title :
Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences
Author :
Helleseth, Tor ; Kim, Sang-Hyo ; No, Jong-Seon
Author_Institution :
Dept. of Inf., Bergen Univ., Norway
fYear :
2002
fDate :
2002
Firstpage :
180
Abstract :
The linear complexity over Fp, i.e., p-rank and trace representation of Lempel-Cohn-Eastman sequences of period pm-1 for an odd prime p is determined.
Keywords :
binary sequences; computational complexity; Lempel-Cohn-Eastman sequences; autocorrelation function; binary sequences; linear complexity; p-rank; trace representation; Autocorrelation; Binary sequences; Equations; Fourier transforms; Galois fields;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
Type :
conf
DOI :
10.1109/ISIT.2002.1023452
Filename :
1023452
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2055289
بازگشت