Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice

DOI10.1109/TIT.1986.1057135zbMATH Open0621.94017OpenAlexW2137345636MaRDI QIDQ3758720FDOQ3758720

J. H. Conway, N. J. A. Sloane

Publication date: 1986

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

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

Recommendations

• scientific article; zbMATH DE number 1456829
• The Leech lattice, the octacode, and decoding algorithms
• Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice
• Soft decoding of the \((23,12,7)\) Golay-code up to five errors
• The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions

zbMATH Keywords

Leech latticedecoding algorithmsGolay codesoft decision decoding

Mathematics Subject Classification ID

Decoding (94B35)

Cited In (6)

• Constrained designs for maximum likelihood soft decoding of \(\text{RM} (2,m)\) and the extended Golay codes
• Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
• Title not available (Why is that?)
• The Leech lattice, the octacode, and decoding algorithms
• On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
• Soft decoding of short/medium length codes using ordered statistics for quantum key distribution

This page was built for publication: Soft decoding techniques for codes and lattices, including 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 Q3758720)