On maximum likelihood soft decoding of some binary self-dual codes
- 1 March 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 41 (3) , 439-443
- https://doi.org/10.1109/26.221070
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Reduced lists of error patterns for maximum likelihood soft decodingIEEE Transactions on Information Theory, 1991
- More efficient soft decoding of the Golay codesIEEE Transactions on Information Theory, 1991
- Bounds on the dimension of codes and subcodes with prescribed contraction indexLinear Algebra and its Applications, 1990
- The 'stretched'-Golay and other codes for high-SNR finite-delay quantization of the Gaussian source at 1/2 bit per sampleIEEE Transactions on Communications, 1990
- Maximum likelihood soft decoding of binary block codes and decoders for the Golay codesIEEE Transactions on Information Theory, 1989
- Soft decoding techniques for codes and lattices, including the Golay code and the Leech latticeIEEE Transactions on Information Theory, 1986
- Error-Correction Coding for Digital CommunicationsPublished by Springer Nature ,1981
- On the enumeration of self-dual codesJournal of Combinatorial Theory, Series A, 1980
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978
- Coding for constant-data-rate systemsTransactions of the IRE Professional Group on Information Theory, 1954