Some constructions of superimposed codes in Euclidean spaces.
From MaRDI portal
Recommendations
Cites work
- An improved upper bound of the rate of Euclidean superimposed codes
- Codes on Euclidean spheres
- Designs as maximum codes in polynomial metric spaces
- scientific article; zbMATH DE number 1224949 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- On spherical codes generating the kissing number in dimensions 8 and 24
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Spherical codes generated by binary partitions of symmetric pointsets
- Superimposed codes in \(\mathbb{R}^n\) obtained from spherical codes
- Superimposed codes in R/sup n/
- Superimposed codes in the Hamming space
- The concatenation method for constructing spherical codes in n-dimensional Euclidean space
- Upper bounds on the minimum distance of spherical codes
Cited in
(5)- A classification of the structures of some Sperner families and superimposed codes
- Superimposed codes in \(\mathbb{R}^n\) obtained from spherical codes
- scientific article; zbMATH DE number 2154113 (Why is no real title available?)
- An improved upper bound of the rate of Euclidean superimposed codes
- Uniqueness of the 120-point spherical 11-design in four dimensions
This page was built for publication: Some constructions of superimposed codes in Euclidean spaces.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811096)
