Spectral-Null Codes and Null Spaces of Hadamard Submatrices
Designs, Codes and Cryptography
Design of Balanced and Constant Weight Codes for VLSI Systems
IEEE Transactions on Computers
Balanced Codes with Parallel Encoding and Decoding
IEEE Transactions on Computers
Design of Efficient Balanced Codes
IEEE Transactions on Computers
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Simple balanced codes that approach capacity
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Efficient balancing of q-ary sequences with parallel decoding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
IEEE Journal on Selected Areas in Communications
Knuth's balanced codes revisited
IEEE Transactions on Information Theory
Sphere coverings and identifying codes
Designs, Codes and Cryptography
| Hi-index | 754.90 |
For n>0, d⩾0, n≡d (mod 2), let K(n, d) denote the minimal cardinality of a family V of ±1 vectors of dimension n, such that for any ±1 vector w of dimension n there is a v∈V such that |v- w|⩽d, where v-w is the usual scalar product of v and w. A generalization of a simple construction due to D.E. Knuth (1986) shows that K(n , d)⩽[n/(d+1)]. A linear algebra proof is given here that this construction is optimal, so that K(n, d)-[n/(d+1)] for all n≡d (mod 2). This construction and its extensions have applications to communication theory, especially to the construction of signal sets for optical data links