Some constructions of superimposed codes in Euclidean spaces
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Linear size optimal q-ary constant-weight codes and constant-composition codes
IEEE Transactions on Information Theory
Hi-index | 754.90 |
Several constructions are presented by which spherical codes are generated from groups of binary codes. In the main family of constructions the codes are generated from equally spaced symmetric pointsets on the real line. The main ideas are code concatenation and set partitioning. Extensive tables are presented for spherical codes in dimension n⩽24