articleTop 10% cited

Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)

IEEE Transactions on Information Theory · 1974 · Vol. 20(2) · pp. 284–287

L.R. Bahl✉(IBM Research - Thomas J. Watson Research Center)John Cocke(IBM Research - Thomas J. Watson Research Center)F. Jelinek(IBM Research - Thomas J. Watson Research Center)J. Raviv(IBM Research - Haifa)

View via DOI Publisher page

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.

Advanced Wireless Communication Techniques Error Correcting Code Techniques Cellular Automata and ApplicationsDecoding methodsConvolutional codeSequential decodingBlock codeList decodingAlgorithmSerial concatenated convolutional codesConcatenated error correction codeMathematicsLinear code

Citations

5,141

FWCI

3.49

field-weighted impact

References

Percentile

92%

vs. same field & year

Citations per year

Cited by

Turbo decoding as an instance of Pearl's "belief propagation" algorithm