Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
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.
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Reena Elangovan, Shubham Jain, et al.
ACM TODAES