Article

Designs, Codes and Cryptography

, Volume 30, Issue 1, pp 73-84

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

  • Cunsheng DingAffiliated withDepartment of Computer Science, The Hong Kong University of Science and Technology
  • , Mordecai GolinAffiliated withDepartment of Computer Science, The Hong Kong University of Science and Technology
  • , Torleiv KløveAffiliated withDepartment of Information Engineering, The Chinese University of Hong Kong

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.

binary sequences code division multiple access codes Welch bound Karystinos-Pados bound