Spherical codes generated by binary partitions of symmetric pointsets
Thorild Ericson, Victor A. Zinoviev · IEEE Transactions on Information Theory · 1995
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/spl les/24.>