Abstract

The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered. The decoding of linear block and convolutional codes to minimize symbol error probability is shown to be a special case of this problem. An optimal decoding algorithm is derived.

Keywords

Decoding methodsConvolutional codeSequential decodingBlock codeList decodingAlgorithmSerial concatenated convolutional codesConcatenated error correction codeMathematicsLinear codeComputer scienceMarkov processTurbo codeStatistics

Affiliated Institutions

Related Publications

Expander codes

M. Sipser , Daniel A. Spielman

Using expander graphs, we construct a new family of asymptotically good, linear error-correcting codes. These codes have linear time sequential decoding algorithms and logarithm...

1996 IEEE Transactions on Information Theory 920 citations

Publication Info

Year
1974
Type
article
Volume
20
Issue
2
Pages
284-287
Citations
5105
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

5105
OpenAlex

Cite This

L.R. Bahl, John Cocke, F. Jelinek et al. (1974). Optimal decoding of linear codes for minimizing symbol error rate (Corresp.). IEEE Transactions on Information Theory , 20 (2) , 284-287. https://doi.org/10.1109/tit.1974.1055186

Identifiers

DOI
10.1109/tit.1974.1055186