Codebooks from almost difference sets

Authors:
Cunsheng Ding;Tao Feng
Affiliations:
Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Kowloon, China;School of Mathematical Sciences, Peking University, Beijing, China 100871
Venue:
Designs, Codes and Cryptography
Year:
2008

Citing 11
Cited 2

Design theory

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

Designs, Codes and Cryptography
A family of skew Hadamard difference sets

Journal of Combinatorial Theory Series A
Autocorrelation values of generalized cyclotomic sequences of order two

IEEE Transactions on Information Theory
New families of binary sequences with optimal three-level autocorrelation

IEEE Transactions on Information Theory
Almost difference sets and their sequences with optimal autocorrelation

IEEE Transactions on Information Theory
A class of balanced binary sequences with optimal autocorrelation properties

IEEE Transactions on Information Theory
Grassmannian beamforming for multiple-input multiple-output wireless systems

IEEE Transactions on Information Theory
Achieving the Welch bound with difference sets

IEEE Transactions on Information Theory
Complex Codebooks From Combinatorial Designs

IEEE Transactions on Information Theory
A Generic Construction of Complex Codebooks Meeting the Welch Bound

IEEE Transactions on Information Theory

Partial fourier codebooks associated with multiplied golay complementary sequences for compressed sensing

SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
Gauss periods and codebooks from generalized cyclotomic sets of order four

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

In direct spread CDMA systems, codebooks meeting the Welch bounds are used to distinguish among the signals of different users. Recently, constructions of codebooks with difference sets meeting Welch's bound on the maximum cross-correlation amplitude were developed. In this paper, a generic construction of codebooks using almost difference sets is considered and several classes of codebooks nearly meeting the Welch bound are obtained. The parameters of the codebooks constructed in this paper are new.