On the Karystinos-Pados Bounds and Optimal Binary DS-CDMA Signature Ensembles

IEEE Communications Letters

Volumn 8, Issue 2, 2004, Pages 81-83

  Ipatov, Valery P ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

Code division multiple access (CDMA) signatures; Karystinos Pados bounds; Welch bound

Indexed keywords

ALGORITHMS; BINARY CODES; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; CORRELATION THEORY; DIRECT SEQUENCE SYSTEMS; FUNCTION EVALUATION; GAUSSIAN NOISE (ELECTRONIC); MATRIX ALGEBRA; OPTIMIZATION;

CDMA SIGNATURES; KARYSTINOS-PADOS BOUNDS; WELCH BOUNDS;

CODE DIVISION MULTIPLE ACCESS;

EID: 1642264964     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2004.823428     Document Type: Article

References (7)

1. M. Rupf and J. L. Massey, "Optimum sequence multisets for synchronous code-division multiple-access channels," IEEE Trans. Inform. Theory, vol. 40, pp. 1261-1266, July 1994.
2. D. V. Sarwate, "Meeting the Welch bound with equality," in Proc. Sequences and Their Applications (SETA'98), C. Ding, T. Helleseth, and H. Niederreiter, Eds., London, U.K., 1999.
3. J. L. Massey and T. Mittelholzer, "Welch's bound and sequence sets for code-division multiple-access systems," in Sequences II, Methods in Communication, Security, and Computer Sciences, R. Capocelli, A. De Santis, and U. Vaccaro, Eds. New York: Springer-Verlag, 1993.
4. R. L. Welch, "Lower bound on the maximum cross-correlation of signals," IEEE Trans. Inform. Theory, vol. IT-20, pp. 397-399, May 1974.
5. G. N. Karystinos and D. A. Pados, "New bounds on the total squared correlation and optimum design of DS-CDMA binary signature sets," IEEE Trans. Commun., vol. 51, pp. 48-51, Jan. 2003.
6. C. Ding, M. Golin, and T. Klove, "Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets," Designs, Coding, and Cryptography, vol. 30, pp. 73-84, Aug. 2003.
7. L. D. Baumert, Cyclic Difference Sets. New York: Springer-Verlag, 1971.