Reduced lists of error patterns for maximum likelihood soft decoding
- 1 July 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (4) , 1194-1200
- https://doi.org/10.1109/18.86973
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- A Leech lattice modemIEEE Journal on Selected Areas in Communications, 1989
- A bounded-distance decoding algorithm for the Leech lattice, with generalizationsIEEE Transactions on Information Theory, 1989
- Multilevel codes and multistage decodingIEEE Transactions on Communications, 1989
- Fast decoding of the Leech latticeIEEE Journal on Selected Areas in Communications, 1989
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Optimal soft decision block decoders based on fast Hadamard transformIEEE Transactions on Information Theory, 1986
- Another upper bound on covering radiusIEEE Transactions on Information Theory, 1983
- The construction of fast, high-rate, soft decision block decodersIEEE Transactions on Information Theory, 1983
- The technology of error-correcting codesProceedings of the IEEE, 1980
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978