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

Authors:
Cunsheng Ding;Mordecai Golin;Torleiv Kløve
Affiliations:
Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China cding@cs.ust.hk;Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China golin@cs.ust.hk;Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong, China (on leave from the University of Bergen, Norway) Torleiv.Klove@ii.uib.no
Venue:
Designs, Codes and Cryptography
Year:
2003

Citing 1
Cited 5

On the excess of Hadamard matrices

Discrete Mathematics

Codebooks from almost difference sets

Designs, Codes and Cryptography
Power minimization for CDMA under colored noise

IEEE Transactions on Communications
New bounds on the total-squared-correlation of quaternary signature sets and optimal designs

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Constructing and decoding GWBE codes using Kronecker products

IEEE Communications Letters
Adaptive binary signature design for code division multiplexing

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications

Quantified Score

Hi-index	0.00

Visualization

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.