More efficient soft decoding of the Golay codes
- 1 May 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (3) , 667-672
- https://doi.org/10.1109/18.79928
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
This publication has 13 references indexed in Scilit:
- A bounded-distance decoding algorithm for the Leech lattice, with generalizationsIEEE Transactions on Information Theory, 1989
- Maximum likelihood soft decoding of binary block codes and decoders for the Golay codesIEEE Transactions on Information Theory, 1989
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Sphere Packings, Lattices and GroupsPublished by Springer Nature ,1988
- New trellis codes based on lattices and cosetsIEEE Transactions on Information Theory, 1987
- Decoding the Golay codesIEEE Transactions on Information Theory, 1986
- Optimal soft decision block decoders based on fast Hadamard transformIEEE Transactions on Information Theory, 1986
- Soft decoding techniques for codes and lattices, including the Golay code and the Leech latticeIEEE Transactions on Information Theory, 1986
- On the uniqueness of the Golay codesJournal of Combinatorial Theory, 1968
- Coding for constant-data-rate systemsTransactions of the IRE Professional Group on Information Theory, 1954