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 Ding
  • Mordecai Golin
  • Torleiv Kløve
Article

DOI: 10.1023/A:1024759310058

Cite this article as:
Ding, C., Golin, M. & Kløve, T. Designs, Codes and Cryptography (2003) 30: 73. doi:10.1023/A:1024759310058

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 

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Cunsheng Ding
    • 1
  • Mordecai Golin
    • 1
  • Torleiv Kløve
    • 2
  1. 1.Department of Computer ScienceThe Hong Kong University of Science and TechnologyClear Water Bay, KowloonChina
  2. 2.Department of Information EngineeringThe Chinese University of Hong KongShatin, N.T.China (on leave from the University of Bergen, Norway

Personalised recommendations