On the linear complexity over Fp of M-ary Sidel'nikov sequences

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 2007-2011

  Kim, Young Sik ^a   Chung, Jung Soo ^a   No, Jong Seon ^a   Chung, Habong ^b  

^a Seoul National University   (South Korea)

^b Hong Ik University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR COMPLEXITY; M-ARY SIDEL'NIKOV SEQUENCES;

COMPUTATIONAL COMPLEXITY; FOURIER TRANSFORMS;

INFORMATION THEORY;

EID: 33749434820     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523697     Document Type: Conference Paper

References (8)

1. Elwyn R. Berlekamp, Algebraic Coding Theory, revised ed., Laguna Hills, CA: Aegean Park Press, 1987.
2. R. E. Blahut, "Transform techniques for error control codes," IBM J. Res. Devel., vol. 63, pp. 550-560, 1979.
3. p and trace representation of Lempel-Cohn-Eastman sequences," IEEE Trans. Inform. Theory, vol. 49, no. 6, pp. 1548-1552, June 2003.
4. p of Sidel'nikov sequences," IEEE Trans. Inform. Theory, vol. 50, no. 10, pp. 2468-2472, Oct. 2004.
5. m -1 with optimal autocorrelation," in Proc. 2001 Conf. SETA 2001, 2001, pp. 29-30.
6. Gohar M. Kyureghyan and Alexander Pott, "On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences," Design, Codes and Cryptography, vol. 29, pp. 149-164, 2003.
7. A. Lempel, M. Cohn, and W. L. Eastman, "A Class of Balanced Binary Sequences with Optimal Autocorrelation Properties," IEEE Trans. Inform. Theory, vol. IT-23, no. 1, pp. 38-42, Jan. 1977.
8. V. M. Sidel'nikov, "Some k-valued pseudo-random sequences and nearly equidistant codes," Probl. Inf. Transm., vol. 5, no. 1, pp. 12-16, 1969.