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

1974/03/01 by L.R. Bahl, John Cocke, F. Jelinek +1 · 6 citations
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Cellular Automata and Applications #Error Correcting Code Techniques

paper · doi:10.1109/tit.1974.1055186

openalex publication_date 1974/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

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.

Citations

• Statistical Inference for Probabilistic Functions of Finite State Markov Chains

Cited by

• Continuous speech recognition by statistical methods
• A Systematic Approach to Modified BCJR MAP Algorithms for Convolutional Codes
• Turbo-Annihilation of Hook Errors in Stabilizer Measurement Circuits
• Tail-Calibrated Soft-Output GRAND for Finite-Memory Noise-Effect Posteriors
• How Much Frequency Can Be Reused in 5G Cellular Networks---A Matrix Graph Model
• Frederick Jelinek [wikipedia]