Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets
- Cite this article as:
- Ding, C., Golin, M. & Kløve, T. Designs, Codes and Cryptography (2003) 30: 73. doi:10.1023/A:1024759310058
- 99 Downloads
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.