Bounded-distance decoding of the Leech lattice and the Golay code

DOI10.1007/3-540-57843-9_24MaRDI QIDQ4954428zbMATH OpenFDO

Authors Ofer Amrani, Yair Be'ery, Alexander Vardy

Publication date 7 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57843-9_24

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions
• Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice
• Maximum likelihood decoding of the Leech lattice

Cited in

(7)

• Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
• scientific article; zbMATH DE number 524753 (Why is no real title available?)
• Maximum likelihood decoding of the Leech lattice
• The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions
• A bounded-distance decoding algorithm for lattices obtained from a generalized code formula
• The Leech lattice, the octacode, and decoding algorithms
• Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice

This page was built for publication: Bounded-distance decoding of the Leech lattice and the Golay code

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