Asymptotically dense spherical codes. I. Wrapped spherical codes

DOI10.1109/18.641544MaRDI QIDQ4392379zbMATH 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/3ada76c4d950618f8eacaa7b5447a80c923a4e8e

zbMATH Keywords

asymptotic densitychannel codinglaminated latticespackingsource codingspherical codes

Mathematics Subject Classification ID

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

Recommendations

• Asymptotically dense spherical codes .II. laminated spherical codes
• Constructive spherical codes near the Shannon bound
• The concatenation method for constructing spherical codes in n-dimensional Euclidean space
• Dense sphere packings from new codes

Cited in

(10)

• Constructive spherical codes near the Shannon bound
• A shape-gain approach for vector quantization based on flat tori
• A heuristic approach for designing cyclic group codes
• An algorithm for maximising covered area
• Iteratively maximum likelihood decodable spherical codes and a method for their construction
• Asymptotically dense spherical codes .II. laminated spherical codes
• scientific article; zbMATH DE number 1756459 (Why is no real title available?)
• Spherical codes generated by binary partitions of symmetric pointsets
• Asymptotic bounds for spherical codes
• A basic homogenization problem for the \(p\)-Laplacian in \(\mathbb{R}^d\) perforated along a sphere: \(L^\infty\) estimates

This page was built for publication: Asymptotically dense spherical codes. I. Wrapped spherical codes

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