Spherical codes generated by binary partitions of symmetric pointsets

DOI10.1109/18.370114zbMath0838.94016OpenAlexW2102212547MaRDI QIDQ4840876

Victor A. Zinoviev, Thomas Ericson

Publication date: 3 June 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.370114

zbMATH Keywords

spherical codesset partitioningcode concatenation

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Cyclic codes (94B15) Combinatorial codes (94B25)

Related Items (7)

Unnamed Item ⋮ Optimal FHSs and DSSs via near zero-difference balanced functions ⋮ On one construction method for Hadamard matrices ⋮ Room squares with super-simple property ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ On the generalized concatenated construction for codes in \(L_1\) and Lee metrics ⋮ Some constructions of superimposed codes in Euclidean spaces.

This page was built for publication: Spherical codes generated by binary partitions of symmetric pointsets