Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
IEEE Transactions on Information TheoryPublished 1 March 1974
L.R. Bahl, John Cocke, F. Jelinek, J. Raviv
Citations5,120
SJR quartileQ1
SJR score1.46
SNIP1.76
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
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 and an optimal decoding algorithm is derived.
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
Computer ScienceEngineering
IEEE Transactions on Information TheoryError bounds for convolutional codes and an asymptotically optimum decoding algorithm
6,705 Citations1967Andrew J. Viterbi
The upper bound is obtained for a specific probabilistic nonsequential decoding algorithm which is shown to be asymptotically optimum for rates above R_{0} and whose performance bears certain similarities to that of sequential decoding algorithms.
Proceedings of the IEEEThe viterbi algorithm
5,595 Citations1973G. David Forney
This paper gives a tutorial exposition of the Viterbi algorithm and of how it is implemented and analyzed, and increasing use of the algorithm in a widening variety of areas is foreseen.
IEEE Transactions on Information TheoryOn receiver structures for channels having memory
148 Citations1966Ronald Y. Chang, John C. Hancock
Receiver structures are developed for making jointly optimum decisions about L consecutive symbols on the basis of the complete message received and the decision statistics are computed by a sequential procedure, and the number of computations increases only linearly with the message length.
Information and ControlBootstrap hybrid decoding for symmetrical binary input channels
24 Citations1971F. Jelinek, John Cocke
A new method of decoding is presented that utilizes algebraic constraints across streams of convolutionally encoded information sequences to improve the performance of ordinary sequential decoding and over the older hybrid scheme developed by Falconer.