Linear complexity over Fp and trace representation of lempel-cohn-eastman sequences

IEEE Transactions on Information Theory

Volumn 49, Issue 6, 2003, Pages 1548-1552

  Helleseth, Tor ^a   Kim, Sang Hyo ^b   No, Jong Seon ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b Seoul National University   (South Korea)

Author keywords

Lempel Cohn Eastman (LCE) sequences; Linear complexity; Sequences

Indexed keywords

COMPUTATIONAL COMPLEXITY; FOURIER TRANSFORMS; NUMBER THEORY;

LINEAR COMPLEXITY;

INFORMATION THEORY;

EID: 0038718574     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.811924     Document Type: Article

References (24)

1. L. D. Baumert, Cyclic Difference Sets (Lecture Notes in Mathematics). New York: Springer-Verlag, 1971.
2. E. R. Berlekamp, Algebraic Coding Theory, revised ed. Laguna Hills, CA: Aegean Park, 1984.
3. R. E. Blahut, "Transform techniques for error control codes," IBM J. Res. Develop., vol. 23, pp. 299-315, 1979.
4. _, Theory and Practice of Error Control Codes. New York: Addison-Wesley, 1983.
5. H. Chung and J.-S. No, "Linear span of extended sequences and cascaded GMW sequences," IEEE Trans. Inform. Theory, vol. 45, pp. 2060-2064, Sept. 1999.
6. C. Ding, T. Helleseth, and W. Shan, "On the linear complexity of Legendre sequences," IEEE Trans. Inform. Theory, vol. 44, pp. 1276-1278, May 1998.
7. H. Dobbertin, "Kasami power functions, permutation polynomials and cyclic difference sets," in Proc. NATO Advanced Study Institute Workshop on Difference Sets, Sequences and Their Correlation Properties, Bad Windsheim, Germany, Aug. 3-14, 1998.
8. S. W. Golomb, Shift-Register Sequences. San Francisco/Laguna Hills, CA: Holden- Day/Aegean Park, 1967/1982.
9. m -1 with optimal autocorrelation," in Proc. 2001 Conf. Sequences and Their Applications (SETA '01), Bergen, Norway, May 13-17, 2001, pp. 29-30.
10. D. Jungnickel, Finite Fields. Mannheim, Germany: B. I. Wissenschaftsverlag, 1993.
11. J.-H. Kim and H.-Y. Song, "Characteristic polynomial and linear complexity of Hall's sextic residue sequences," in Proc. 2001 Conf. Sequences and Their Applications (SETA '01), Bergen, Norway, May 13-17, 2001, pp. 33-34.
12. A. Lempel, M. Cohn, and W. L. Eastman, "A class of binary sequences with optimal autocorrelation properties," IEEE Trans. Inform. Theory, vol. IT-23, pp. 38-42, Jan. 1977.
13. R. Lidl and H. Niederreiter, "Finite fields," in Encyclopedia of Mathematics and Its Applications. Reading, MA: Addison-Wesley, 1983, vol. 20.
14. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
15. d + b," IEEE Trans. Inform. Theory, vol. 47, pp. 1638-1644, May 2001.
16. d," IEEE Trans. Inform. Theory, vol. 45, pp. 1278-1282, May 1999.
17. n -1 with ideal autocorrelation," IEEE Trans. Inform. Theory, vol. 44, pp. 814-817, Mar. 1998.
18. J.-S. No, H.-K. Lee, H. Chung, H.-Y. Song, and K. Yang, "Trace representation of Legendre sequence of Mersenne prime period," IEEE Trans. Inform. Theory, vol. 42, pp. 2254-2255, Nov. 1996.
19. J.-S. No, K. Yang, H. Chung, and H.-Y. Song, "On the construction of binary sequences with ideal autocorrelation property," in Proc. 1996 IEEE Int. Symp. Information Theory and Its Applications (ISITA '96), Victoria, BC, Canada, Sept. 17-20, 1996, pp. 837-840.
20. R. A. Scholtz and L. R. Welch, "GMW sequences," IEEE Trans. Inform. Theory, vol. IT-30, pp. 548-553, May 1984.
21. V. M. Sidelnikov, "Some k-valued pseudo-random and nearly equidistant codes," Probl. Pered. Inform., vol. 5, no. 1, pp. 16-22, 1969.
22. M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications, revised ed. Rockville, MD/New York: Computer Science/McGraw-Hill, 1985/1994, vol. 1.
23. T. Storer, Cyclotomy and Difference Sets (Lecture Notes in Advanced Mathematics). Chicago, IL: Markham, 1967.
24. R. Turyn, "The linear generation of the Legendre sequences," J. Soc. Ind. Appl. Math, vol. 12, no. 1, pp. 115-117, 1964.