Bounded-distance decoding of the leech lattice and the golay code

Ofer Amrani, Yair Be’Ery, Alexander Vardy

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


We present an efficient algorithm for bounded-distance decoding of the Leech lattice. The new bounded-distance algorithm employs the partition of the Leech lattice into four cosets of Q24, beyond the conventional partition into two H24 cosets. The complexity of the resulting decoder is only 1007 real operations in the worst case, as compared to about 3600 operations for the best known maximum-likelihood decoder and about 2000 operations for the original bounded-distance decoder of Forney. Restricting the proposed Leech lattice decoder to GF(2)24 yields a bounded-distance decoder for the binary Golay code which requires at most 431 operations as compared to 651 operations for the best known maximum-likelihood decoder. Moreover, it is shown that our algorithm decodes correctly at least up to the guaranteed error-correction radius of the Leech lattice. Performance of the algorithm on the AWGN channel is evaluated analytically by explicitly calculating the effective error- coefficient, and experimentally by means of a comprehensive computer simulation. The results show a loss in coding-gain of less than 0.1 dB relative to the maximum-likelihood decoder for BER ranging from 10-1 to 10-7.

Original languageEnglish
Title of host publicationAlgebraic Coding - 1st French-Israeli Workshop, Proceedings
EditorsGerard Cohen, Antoine Lobstein, Gilles Zemor, Simon Litsyn
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783540578437
StatePublished - 1994
Event1st French-Israeli Workshop on Algebraic Coding, 1993 - Paris, France
Duration: 19 Jul 199321 Jul 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume781 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference1st French-Israeli Workshop on Algebraic Coding, 1993


Dive into the research topics of 'Bounded-distance decoding of the leech lattice and the golay code'. Together they form a unique fingerprint.

Cite this