Bent-Function Sequences

IEEE Transactions on Information Theory

Volumn 28, Issue 6, 1982, Pages 858-864

  Olsen, John D ^a   Scholtz, Robert A ^b   Welch, Lloyd R ^b  

^a RAYTHEON COMPANY   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

EID: 0020203323     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1982.1056589     Document Type: Article

References (21)

1. R. A. Scholtz, “The spread spectrum concept,” IEEE Trans. Commun., vol. COM-25, pp. 748-755. Aug. 1977.
2. R. C. Dixon, Spread Spectrum Systems. New York: Wiley, 1976.
3. J. J. Spilker, Jr., “GPS signal structure and performance characteristics,” Navigation, vol. 25, no. 2, pp. 121-146, Summer 1978.
4. R. Dixon, et al., “TDRSS telecommunications system PN code analysis,” Nat. Tech. Inform. Serv. Rep. N77-29350, Aug. 1976.
5. S. W. Golomb, et al., Digital Communications with Space Applications. Englewood Cliffs, NJ: Prentice Hall, 1964.
6. S. W. Golomb, Shift Register Sequences. San Francisco: Holden-Day, 1976.
7. N. Zierler, “Linear recurring sequences,” J. Siam Appi. Math., vol. 7, pp. 31-48, 1959.
8. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
9. W. W. Peterson, Error-Correcting Codes. Cambridge, MA: M.I.T. 1961.
10. W. Feit, Characters of Finite Groups. New York: W. A. Benjamin, 1967.
11. L. R. Welch, “Lower bounds on the maximum cross correlation of signals,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 397-399, May 1974.
12. R. Gold, “Optimal binary sequences for spread spectrum multiplexing,” IEEE Trans. Inform. Theory, vol. IT-13, no. 4, pp. 619-621, Oct. 1967.
13. R. Gold,, “Maximal recursive sequences with 3-valued recursive cross-correlation functions,” IEEE Trans. Inform. Theory, vol. 14, no. 1, pp. 154-156, Jan. 1968.
14. O. S. Rothaus, “On ‘bent’ functions,” J. Comb. Theory, Series A20, pp. 300-305, 1976.
15. J. F. Dillon, “Elementary Hadamard difference sets,” Ph.D. dissertation, University of Maryland, 1974.
16. R. L. McFarland, “A family of difference sets in non-cyclic groups,” J. Comb. Theory, Series A15, pp. 1-10, 1976.
17. A. Lempel, “Matrix factorization over GF(2n) and trace-orthogonal bases of GF(2n),” SIAM J. Comput., vol. 4, no. 2, pp. 175-186, June 1975.
18. J. MacWilliams, and N. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1978.
19. J. D. Olsen, “Nonlinear binary sequences with asymptotically optimum periodic cross-correlation,” Ph.D. dissertation, University of Southern California, Dec. 1977.
20. W. W. Peterson and E. J. Weldon, Error Correcting Codes. Cambridge, MA: M.I.T., 1971.
21. E. L. Key, “An analysis on the structure and complexity of non-linear binary sequence generators,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 732-736, Nov. 1976.