Maximum likelihood decoding of the Leech lattice

DOI10.1109/18.243466MaRDI QIDQ4307354zbMATH OpenOpenAlexFDO

Authors Alexander Vardy, Yair Be'ery

Publication date 4 October 1994

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

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

zbMATH Keywords

algorithmbinary Golay codelattice codesLeech latticemaximum likelihood decoding

Mathematics Subject Classification ID

Decoding (94B35) Arithmetic codes (94B40)

Recommendations

• scientific article; zbMATH DE number 1456829
• Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice
• The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions

Cited in

(4)

• The Leech lattice, the octacode, and decoding algorithms
• scientific article; zbMATH DE number 1456829 (Why is no real title available?)
• Lattice codes for CRYSTALS-Kyber
• Compact lattice-coded (multi-recipient) Kyber without CLT independence assumption

This page was built for publication: Maximum likelihood decoding of the Leech lattice

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