Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Bahl et al. (1974) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: