The Leech lattice, the octacode, and decoding algorithms
From MaRDI portal
(Redirected from Publication:4857510)
Recommendations
- Maximum likelihood decoding of the Leech lattice
- The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions
- scientific article; zbMATH DE number 1456829
- Higher power residue codes and the Leech lattice
- Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice
- Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
- Octonions and the Leech lattice
- Orthogonal designs, self‐dual codes, and the Leech lattice
- Decoding a class of alternant codes for the Lee metric
- Lattice coding
Cited in
(6)- Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
- 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
- Algorithm 810: The SLEIGN2 Sturm-Liouville Code
- How to expand a self-orthogonal code
- A generic construction on self-orthogonal algebraic geometric codes and its applications
This page was built for publication: The Leech lattice, the octacode, and decoding algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857510)