Codebooks from almost difference sets
Designs, Codes and Cryptography
Optimal and perfect difference systems of sets
Journal of Combinatorial Theory Series A
Sets of frequency hopping sequences: bounds and optimal constructions
IEEE Transactions on Information Theory
The weight distribution of some irreducible cyclic codes
IEEE Transactions on Information Theory
Optimal sets of frequency hopping sequences from linear cyclic codes
IEEE Transactions on Information Theory
Construction of cyclotomic codebooks nearly meeting the Welch bound
Designs, Codes and Cryptography
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
Unit time-phase signal sets: Bounds and constructions
Cryptography and Communications
Gauss periods and codebooks from generalized cyclotomic sets of order four
Designs, Codes and Cryptography
| Hi-index | 755.02 |
Codebooks (also called signal sets) meeting the Welch bounds are desirable in code-division multiple-access (CDMA) systems. In 2003, binary codebooks meeting Welch's bounds were constructed using difference sets by Ding, Golin, and Kloslashve. Recently, a generic construction of codebooks with cyclic difference sets meeting Welch's bound on the maximum cross-correlation amplitude was developed by Xia In this correspondence, the idea of Xia is extended, and related constructions of optimal codebooks with both cyclic and noncyclic difference sets are presented. These codebooks are optimal in the sense that they also meet this Welch bound. In addition, complex codebooks that almost meet Welch's bound on the maximum cross-correlation amplitude are also constructed with almost difference sets