Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice

DOI10.1109/18.412695MaRDI QIDQ4859776zbMATH OpenOpenAlexFDO

Authors Alexander Vardy

Publication date 15 April 1996

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

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

zbMATH Keywords

bounded-distance decodingdecoding algorithmGolay codeLeech lattice

Mathematics Subject Classification ID

Lattice packing and covering (number-theoretic aspects) (11H31) Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 1456829
• On algebraic decoding of some maximal quaternary codes and the binary Golay code
• The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions
• Fast algorithms for decoding the (23, 12) binary Golay code with four-error-correcting capability
• The Leech lattice, the octacode, and decoding algorithms

Cited in

(8)

• Reed-Muller codes and Barnes-Wall lattices: generalized multilevel constructions and representation over \(\mathrm{GF}(2^q)\)
• A lattice-based McEliece scheme for encryption and signature
• Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
• Maximum likelihood decoding of the Leech lattice
• The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions
• The Leech lattice, the octacode, and decoding algorithms
• scientific article; zbMATH DE number 1456829 (Why is no real title available?)
• On the universal embedding of the near hexagon related to the extended ternary Golay code

This page was built for publication: Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice

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