Decoding linear block codes for minimizing word error rate (Corresp.)
- 1 November 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 25 (6) , 733-737
- https://doi.org/10.1109/tit.1979.1056120
Abstract
Two modifications of the basic correlation decoding approach are presented. One of them yields a nonexhaustive optimum word decoding algorithm whose complexity depends upon the "projecting" structure of the code. This algorithm is then modified to yield a second decoding algorithm which, while not optimum, has simpler complexity. Applications to the AWGN channel are discussed and performance curves are given for (24, 12) and (31, 15) codes.Keywords
This publication has 8 references indexed in Scilit:
- 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
- A decoding algorithm for binary block codes andJ-ary output channels (Corresp.)IEEE Transactions on Information Theory, 1974
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974
- Class of algorithms for decoding block codes with channel measurement informationIEEE Transactions on Information Theory, 1972
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967
- Generalized minimum distance decodingIEEE Transactions on Information Theory, 1966