DocumentCode :
2617758
Title :
More efficient bounded-distance decoding of the Golay code and the Leech lattice
Author :
Sun, Feng-Wen ; Van Tilborg, Henk C A
Author_Institution :
Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands
fYear :
1994
fDate :
27 Jun-1 Jul 1994
Firstpage :
399
Abstract :
New multilevel constructions of the Leech lattice and the Golay code are presented. They are derived from Turyn´s constructions and the `holy construction´ with the octacode as the glue code. Further, we show that the `holy construction´ of the Leech lattice with the octacode as the glue code is essentially different from the permuted Turyn construction, although both constructions rely on the octacode. Based on these structures, more efficient bounded-distance decoding algorithms of the Golay code and the Leech lattice are presented
Keywords :
Golay codes; decoding; Golay code; Leech lattice; bounded-distance decoding; bounded-distance decoding algorithms; glue code; holy construction; multilevel code constructions; octacode; Combinatorial mathematics; Computer errors; Computer simulation; Error correction codes; Lattices; Maximum likelihood decoding; Performance loss; Societies; Sun;
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.394620
Filename :
394620
Link To Document :
بازگشت