Efficient optimal decoding of linear block codes (Corresp.)
- 1 September 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 26 (5) , 603-606
- https://doi.org/10.1109/tit.1980.1056238
Abstract
An optimal soft decision (maximum likelihood) decoding scheme for linear block codes is described which works in the code domain and is relatively simple. It can be simplified further by considering more channel measurement information. Furthermore, optimal decoder complexity can be traded for asymptotically optimum performance.Keywords
This publication has 11 references indexed in Scilit:
- Decoding linear block codes for minimizing word error rate (Corresp.)IEEE Transactions on Information Theory, 1979
- Algebraic analog decoding of linear binary codesIEEE Transactions on Information Theory, 1979
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978
- An optimum symbol-by-symbol decoding rule for linear codesIEEE Transactions on Information Theory, 1976
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974
- Algebraic decoding of block codes over a q-ary input, Q-ary output channel, Q > qInformation and Control, 1973
- Class of algorithms for decoding block codes with channel measurement informationIEEE Transactions on Information Theory, 1972
- Decoding binary block codes onQ-ary output channelsIEEE Transactions on Information Theory, 1971
- New binary coding results by circulantsIEEE Transactions on Information Theory, 1969
- Generalized minimum distance decodingIEEE Transactions on Information Theory, 1966