DocumentCode :
2617752
Title :
Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code
Author :
Amrani, Ofer ; Be´ery, Yair
Author_Institution :
Dept. of Electr. Eng.-Syst., Tel Aviv Univ., Israel
fYear :
1994
fDate :
27 Jun-1 Jul 1994
Firstpage :
400
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
Keywords :
Golay codes; decoding; error correction codes; linear codes; trellis codes; Golay code; Leech lattice decoder; bounded-distance decoding; error correction radius; hexacode; linear code; maximum-likelihood decoding; performance; quaternary code; simulation results; soft decision algorithms; trellis codes; Computational complexity; Convolutional codes; Error analysis; Error correction; Error correction codes; Lattices; Linear code; Maximum likelihood decoding; Neodymium;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
Type :
conf
DOI :
10.1109/ISIT.1994.394619
Filename :
394619
Link To Document :
بازگشت