Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
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.
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
György E. Révész
Theoretical Computer Science
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking