论文信息 - Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets

Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets

The Welch lower bound on the total-squared-correlation (TSC) of binary signature sets is loose for binary signature sets whose length L is not a multiple of 4. Recently Karystinos and Pados [6,7] developed new bounds that are better than the Welch bound in those cases, and showed how to achieve the bounds with modified Hadamard matrices except in a couple of cases. In this paper, we study the open cases.

[1] Yuan Luo,et al. On Equidistant Constant Weight Codes , 2001, Electron. Notes Discret. Math..

[2] Lih-Yuan Deng,et al. Orthogonal Arrays: Theory and Applications , 1999, Technometrics.

[3] Douglas R Stinson,et al. Contemporary design theory : a collection of surveys , 1992 .

[4] Stratis Kounias,et al. On the excess of Hadamard matrices , 1988, Discret. Math..

[5] Arthur W. Galston,et al. The Chinese University. , 1973 .

[6] Lloyd R. Welch,et al. Lower bounds on the maximum cross correlation of signals (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[7] Jennifer Seberry,et al. A remark on the excess of Hadamard matrices and orthogonal designs , 1978 .

[8] M. R. Best,et al. The excess of a hadamard matrix , 1976 .

[9] Dimitris A. Pados,et al. Minimum total-squared-correlation design of DS-CDMA binary signature sets , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).