A New Family of Binary Pseudorandom Sequences Having Optimal Periodic Correlation Properties and Large Linear Span

IEEE Transactions on Information Theory

Volumn 35, Issue 2, 1989, Pages 371-379

  No, Jong Seon ^a   Vijay Kumar, P ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0024628422     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.32131     Document Type: Article

References (18)

1. R. A. Scholtz, “The origins of Spread Spectrum Communications,” IEEE Trans. Commun., vol. COM-30, pp. 822-854, May 1982.
2. M. P. Ristenbatt and J. L. Daws, Jr., “Performance criteria forspread spectrum communications,” IEEE Trans. Commun., vol. COM-25, no. 8, pp. 756-763, Aug. 1977.
3. D. V. Sarwarte and M. B. Pursley, “ Crosscorrelation properties ofpseudorandom and related sequences,” Proc. IEEE, vol. 68, no. 5, pp. 593-620, May 1980.
4. R. A. Scholtz and L. R. Welch, “GMW sequences,” IEEE Trans. Inform. Theory, vol. IT-30, no. 3, pp. 548-553, May 1984.
5. J. D. Olsen, R. A. Scholtz, and L. R. Welch, “Bent-function sequences,” IEEE Trans. Inform. Theory, vol. IT-28, no. 6, pp. 858-864, Nov. 1982.
6. P. V. Kumar and R. A. Scholtz, “Bounds on the linear span of bent sequences,” IEEE Trans. Inform. Theory, vol. IT-29, no. 6, pp. 854-862, Nov. 1983.
7. A. Lempel and M. Cohn, “Maximal families of bent sequences,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 865-868, Nov. 1982.
8. R. Gold, “Optimal binary sequences for spread spectrum multiplexing,” IEEE Trans. Inform. Theory, vol. IT-13, no. 5, pp. 619-621, Oct. 1967.
9. R. Gold, “Maximal recursive sequences with 3-valued recursive crosscorrelation functions,” IEEE Trans. Inform. Theory, vol. IT-14, no. 1, pp. 154-156, Jan. 1968.
10. T. Kasami, “Weight distribution formula for some class of cyclic codes,” Coordinated Science Laboratory, University of Illinois, Urbana, Tech. Rep. R-285 (AD632574), 1966.
11. “Weight distribution of Bose-Chaudhuri-Hocquenghemcodes,” in Combinatorial Mathematics and its Applications. Chapel Hill, NC: University of North Carolina Press, 1969.
12. L. R. Welch, “Lower bounds on the maximum cross correlation of signals,” IEEE Trans. Inform. Theory, vol. IT-20, no. 3, pp. 397-399, May 1974.
13. E. L. Key, “An analysis of the structure and complexity of nonlinear binary sequence generators,” IEEE Trans. Inform. Theory, vol. IT-22, no. 6, pp. 732-736, Nov. 1976.
14. S. W. Golomb, Shift Register Sequences. San Francisco, CA: Holden-Day, 1967; revised edition, Laguna Hills, CA: Aegean Park Press, 1982.
15. M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications, vol. I. Rockville, MD: Computer Science Press, 1985.
16. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
17. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977.
18. T. W. Hungerford, Algebra, Graduate Texts in Mathematics. New York: Springer-Verlag, 1974.