Asymptotically dense spherical codes. I. Wrapped spherical codes

DOI10.1109/18.641544zbMath0904.94020OpenAlexW2165750745MaRDI QIDQ4392379

Kenneth Zeger, Jon Hamkins

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

packingasymptotic densityspherical codessource codingchannel codinglaminated lattices

Mathematics Subject Classification ID

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

Related Items (4)

A shape-gain approach for vector quantization based on flat tori ⋮ An algorithm for maximising covered area ⋮ Asymptotic bounds for spherical codes ⋮ A heuristic approach for designing cyclic group codes

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