Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Two soft-decision algorithms for decoding the (6,3,4) quaternary code, the hexacode, are presented. Both algorithms have the same guaranteed error correction radius as that of maximum-likelihood decoding. In using them, bounded-distance decoding of the Golay code and the Leech lattice are performed in at most 187 and 519 real operations respectively. We present some simulation results for the Leech lattice decoder revealing near-optimal performance. A comparison to known trellis codes is also provided.

Original languageEnglish
Title of host publicationProceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages400
Number of pages1
ISBN (Print)0780320158, 9780780320154
DOIs
StatePublished - 1994
Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway
Duration: 27 Jun 19941 Jul 1994

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/TerritoryNorway
CityTrondheim
Period27/06/941/07/94

Fingerprint

Dive into the research topics of 'Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code'. Together they form a unique fingerprint.

Cite this