Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
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. © 1974, IEEE. All rights reserved.
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
Eric Price, David P. Woodruff
FOCS 2011
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev