Spherical codes generated by binary partitions of symmetric pointsets
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1461538
- Asymptotically dense spherical codes. I. Wrapped spherical codes
- The concatenation method for constructing spherical codes in n-dimensional Euclidean space
- New packings on a finite-dimensional Euclidean sphere
- Asymptotically dense spherical codes .II. laminated spherical codes
Cited in
(18)- The generating groups of geometrically uniform spherical signal sets
- Optimal FHSs and DSSs via near zero-difference balanced functions
- Analogs of Steiner's porism and Soddy's hexlet in higher dimensions via spherical codes
- Some constructions of superimposed codes in Euclidean spaces.
- On the generalized concatenated construction for codes in \(L_1\) and Lee metrics
- Room squares with super-simple property
- Codes on Euclidean spheres
- On the optimality of finite constellations from algebraic lattices
- A heuristic approach for designing cyclic group codes
- The concatenation method for constructing spherical codes in n-dimensional Euclidean space
- Finding and investigating exact spherical codes
- scientific article; zbMATH DE number 1461538 (Why is no real title available?)
- scientific article; zbMATH DE number 1756459 (Why is no real title available?)
- Optimal ternary constant-composition codes with weight four and distance six
- Spherically Punctured Biorthogonal Codes
- Construction of spherical codes via the hexagonal matrix
- On one construction method for Hadamard matrices
- Few-cosine spherical codes and Barnes-Wall lattices
This page was built for publication: Spherical codes generated by binary partitions of symmetric pointsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840876)
