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

DOI10.1109/18.412695zbMath0835.94025OpenAlexW2078502923MaRDI QIDQ4859776

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

Leech latticedecoding algorithmGolay codebounded-distance decoding

Mathematics Subject Classification ID

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

Related Items (2)

Reed-Muller codes and Barnes-Wall lattices: generalized multilevel constructions and representation over \(\mathrm{GF}(2^q)\) ⋮ Unnamed Item

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