DocumentCode
1256884
Title
More efficient soft decoding of the Golay codes
Author
Vardy, Alexander ; Be´ery, Y.
Author_Institution
Dept. of Electr. Eng., Tel-Aviv Univ., Israel
Volume
37
Issue
3
fYear
1991
fDate
5/1/1991 12:00:00 AM
Firstpage
667
Lastpage
672
Abstract
An algorithm for maximum-likelihood soft-decision decoding of the binary (24,12,8) Golay code is presented. The algorithm involves projecting the codewords of the binary Golay code onto the codewords of the (6,3,4) code over GF(4)-the hexacode. The complexity of the proposed algorithm is at most 651 real operations. Along similar lines, the tetracode may be employed for decoding the ternary (12,6,6) Golay code with only 530 real operations. The proposed algorithm also implies a reduction in the number of computations required for decoding the Leech lattice.
Keywords
computational complexity; decoding; error correction codes; Golay codes; Leech lattice; algorithm complexity; binary (24,12,8) code; codewords; hexacode; maximum-likelihood soft-decision decoding; ternary (12,6,6) code; tetracode; Boolean functions; Error correction; Error correction codes; Lattices; Maximum likelihood decoding; Notice of Violation;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.79928
Filename
79928
Link To Document