Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
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.
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002