An optimum symbol-by-symbol decoding rule for linear codes
- 1 September 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 22 (5), 514-517
- https://doi.org/10.1109/tit.1976.1055617
Abstract
A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memory]ess channel for any linear error-correcting code when the codewords are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.Keywords
This publication has 8 references indexed in Scilit:
- Syndrome Decoding of Convolutional CodesIEEE Transactions on Communications, 1975
- Coding and CombinatoricsSIAM Review, 1974
- The optimum mean-square estimate for decoding binary block codesIEEE Transactions on Information Theory, 1974
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974
- Real-Time Minimal-Bit-Error Probability Decoding of Convolutional CodesIEEE Transactions on Communications, 1974
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967
- A class of majority logic decodable codes (Corresp.)IEEE Transactions on Information Theory, 1967
- THRESHOLD DECODINGPublished by Defense Technical Information Center (DTIC) ,1963