New construction for families of binary sequences with optimal correlation properties

IEEE Transactions on Information Theory

Volumn 43, Issue 5, 1997, Pages 1596-1602

  No, Jong Seon ^b   Yang, Kyeongcheol ^a,c   Chung, Habong ^a,d   Song, Hong Yeop ^a,e  

^a IEEE

^b Konkuk University   (South Korea)

^c Hanyang University   (South Korea)

^d Hong Ik University   (South Korea)

^e Yonsei University   (South Korea)

Author keywords

Kasami sequences; Legendre sequences; No sequences; Optimal correlation property; Signature sequences

Indexed keywords

CODES (SYMBOLS); CORRELATION THEORY; FUNCTIONS; GRAPH THEORY; MATHEMATICAL MODELS; PROBABILITY; SPREAD SPECTRUM COMMUNICATION;

CODE DIVISION MULTIPLE ACCESS; KASAMI SEQUENCES; LEGENDRE SEQUENCES; NO SEQUENCES; SIGNATURE SEQUENCES;

BINARY SEQUENCES;

EID: 0031235995     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623156     Document Type: Article

References (22)

1. L. D. Baumert, Cyclic Difference Sets (Lecture Notes in Mathematics). Berlin, Germany: Springer-Verlag, 1971.
2. L. D. Baumert and H. Fredrickson, "The cyclotomic numbers of order 18 with applications to difference sets," Math. Comput., vol. 21, pp. 204-219, 1967.
3. D. M. Burton, Elementary Number Theory. Newton, MA: Allyn, 1980.
4. U. Cheng, "Exhaustive construction of (255, 127, 63) cyclic difference sets," J. Combin. Theory, vol. A-35, pp. 115-125, 1983.
5. R. Drier, "(511, 255, 127) cyclic difference sets," IDA Talk, July 1992.
6. R. Gold, "Optimal binary sequences for spread spectrum multiplexing," IEEE Trans. Inform. Theory, vol. IT-13, pp. 619-621, Oct. 1967.
7. n - 1," IEEE Trans. Inform. Theory, vol. IT-26, pp. 730-732, Nov. 1980.
8. _, Shift-Register Sequences. San Francisco, CA: Holden-Day, 1967; Laguna Hills, CA: Aegean Park, 1982.
9. D. Jungnickel, "Difference sets," in Contemporary Design Theory, J. H. Dinitz and D. R. Stinson, Eds. New York: Wiley, 1992, pp. 241-324.
10. R. Lidl and H. Niederreiter, Finite Fields, vol. 20 of Encyclopedia of Mathematics and Its Applications. Reading, MA: Addison-Wesley, 1983.
11. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
12. J. D. Olsen, R. A. Scholtz, and L. R. Welch, "Bent-function sequences," IEEE Trans. Inform. Theory, vol. IT-28, pp. 858-864, Nov. 1982.
13. J.-S. No, "A new family of binary pseudorandom sequences having optimal periodic correlation properties and large linear span," Ph.D. dissertation, Univ. of Southern California, Los Angeles, CA, May 1988.
14. _, "Generalization of GMW sequences and No sequences," IEEE Trans. Inform. Theory, vol. 42, pp. 260-262, Jan. 1996.
15. J.-S. No and P. V. Kumar, "A new family of binary pseudorandom sequences having optimal periodic correlation properties and large linear span," IEEE Trans. Inform. Theory, vol. 35, pp. 371-379, Mar. 1989.
16. J.-S. No, H.-K. Lee, H. Chung, H.-Y. Song, and K. Yang, "Trace representation of Legendre sequences of Mersenne prime period," IEEE Trans. Inform. Theory, vol. 42, pp. 2254-2255, Nov. 1996.
17. J.-S. No, K. Yang, H. Chung, and H.-Y. Song, "Extension of binary sequences with ideal autocorrelation property," in Proc 1996 IEEE Int. Symp. on Information Theory and Its Applications (ISITA '96) (Victoria, BC, Canada, Sept. 17-20, 1996), pp. 837-840.
18. D. V. Sarwate and M. B. Pursley, "Crosscorrelation properties of pseudorandom and related sequences," Proc. IEEE, vol. 68, pp. 593-619, May 1980.
19. V. M. Sidelnikov, "On mutual correlation of sequences," Sov. Math.-Dokl., vol. 12, pp. 197-201, 1971.
20. M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications, vol. 1. Rockville, MD: Computer Sci. Press, 1985.
21. H. Y. Song and S. W. Golomb, "On the existence of cyclic Hadamard difference sets," IEEE Trans. Inform. Theory, vol. 40, pp. 1266-1268, July 1994.
22. L. R. Welch, "Lower bounds on the maximum cross-correlation of signals," IEEE Trans. Inform. Theory, vol. IT-20, pp. 397-399, May 1974.