Nearest neighbor algorithm for spherical codes from the Leech lattice

DOI10.1109/18.21247MaRDI QIDQ3818250zbMATH OpenOpenAlexFDO

Authors Jean-Pierre A. Adoul, Michel Barth

Publication date 1989

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

Full work available at URL https://doi.org/10.1109/18.21247

zbMATH Keywords

extended Golay codeLeech latticesignal set for the Gaussian channelspherical codesvector quantizer

Mathematics Subject Classification ID

Communication theory (94A05) Cyclic codes (94B15)

Recommendations

• Finding and investigating exact spherical codes
• Few-cosine spherical codes and Barnes-Wall lattices
• On computing nearest neighbors with applications to decoding of binary linear codes
• Bounds for spherical codes: the Levenshtein framework lifted
• scientific article; zbMATH DE number 1189034
• scientific article; zbMATH DE number 1189033
• On maximal antipodal spherical codes with few distances
• Upper bounds on the minimum distance of spherical codes
• Asymptotically dense spherical codes .II. laminated spherical codes
• Nearly orthogonal vectors and small antipodal spherical codes

Cited in

(3)

• The covering radius of spherical designs
• A fast encoding method for lattice codes and quantizers
• scientific article; zbMATH DE number 3946030 (Why is no real title available?)

This page was built for publication: Nearest neighbor algorithm for spherical codes from the Leech lattice

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