Asymptotically dense spherical codes .II. laminated spherical codes

DOI10.1109/18.641545MaRDI QIDQ4392380zbMATH OpenOpenAlexFDO

Authors Jon Hamkins, Kenneth Zeger

Publication date 26 January 1999

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

Full work available at URL https://semanticscholar.org/paper/22d44fd96bb10f178fb9ef084337a26578a5e27d

zbMATH Keywords

asymptotic densitychannel codinglaminated latticeslaminated spherical codessource codingspherical codes

Mathematics Subject Classification ID

Source coding (94A29) Linear codes (general theory) (94B05)

Recommendations

• Asymptotically dense spherical codes. I. Wrapped spherical codes
• Polynomial-time construction of codes .II. spherical codes and the kissing number of spheres
• Constructive spherical codes near the Shannon bound

Cited in

(12)

• A shape-gain approach for vector quantization based on flat tori
• Constructive kissing numbers in high-dimensional spaces
• A heuristic approach for designing cyclic group codes
• The concatenation method for constructing spherical codes in n-dimensional Euclidean space
• An algorithm for maximising covered area
• Nearest neighbor algorithm for spherical codes from the Leech lattice
• Polynomial-time construction of codes .II. spherical codes and the kissing number of spheres
• Asymptotically dense spherical codes. I. Wrapped spherical codes
• Spherical codes generated by binary partitions of symmetric pointsets
• Construction of spherical codes via the hexagonal matrix
• Rigidity of spherical codes
• Few-cosine spherical codes and Barnes-Wall lattices

This page was built for publication: Asymptotically dense spherical codes .II. laminated spherical codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4392380)