DocumentCode :
2274260
Title :
On the linear complexity over F/sub p/ of M-ary Sidel´nikov sequences
Author :
Kim, Young-Sik ; Chung, Jung-Soo ; No, Jong-Seon ; Chung, Habong
Author_Institution :
Sch. of Electr. Eng. & Comput. Sci., Seoul Nat. Univ.
fYear :
2005
fDate :
4-9 Sept. 2005
Firstpage :
2007
Lastpage :
2011
Abstract :
In this paper, we derive linear complexity over Fp of the M-ary Sidel´nikov sequences using discrete Fourier transform. As an example, we represent the linear complexity of the ternary Sidel´nikov sequences. It turned out that the ternary Sidel´nikov sequences have the linear complexity nearly close to their periods
Keywords :
computational complexity; discrete Fourier transforms; m-sequences; M-ary Sidel´nikov sequences; discrete Fourier transform; linear complexity; ternary Sidel´nikov sequences; Autocorrelation; Binary sequences; Computer science; Cryptography; Discrete Fourier transforms; Fourier transforms; Galois fields; Hamming weight;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
Type :
conf
DOI :
10.1109/ISIT.2005.1523697
Filename :
1523697
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2274260
بازگشت