Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
- 1 January 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 32 (1), 41-50
- https://doi.org/10.1109/tit.1986.1057135
Abstract
Two kinds of algorithms are considered.1)If *** is a binary code of lengthn, a "soft decision" decoding algorithm for *** changes an arbitrary point ofR^{n}into a nearest codeword (nearest in Euclidean distance).2)Similarly, a decoding algorithm for a latticeLambdainR^{n}changes an arbitrary point ofR^{n}into a closest lattice point. Some general methods are given for constructing such algorithms, ami are used to obtain new and faster decoding algorithms for the Gosset latticeE_{8}, the Golay code the Leech lattice.Keywords
This publication has 46 references indexed in Scilit:
- A permutation decoding of the (24, 12, 8) Golay code (Corresp.)IEEE Transactions on Information Theory, 1983
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)IEEE Transactions on Information Theory, 1982
- On the structure of vector quantizersIEEE Transactions on Information Theory, 1982
- Asymptotically optimal block quantizationIEEE Transactions on Information Theory, 1979
- Algebraic analog decoding of linear binary codesIEEE Transactions on Information Theory, 1979
- Partial-optimal piecewise decoding of linear codesIEEE Transactions on Information Theory, 1978
- A decoding algorithm for binary block codes andJ-ary output channels (Corresp.)IEEE Transactions on Information Theory, 1974
- The viterbi algorithmProceedings of the IEEE, 1973
- Generalized minimum distance decodingIEEE Transactions on Information Theory, 1966
- Gray Codes and Paths on the n-CubeBell System Technical Journal, 1958