Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)

@article{citeulike:1377748, abstract = {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.}, author = {Bahl, L. and Cocke, J. and Jelinek, F. and Raviv, J. }, citeulike-article-id = {1377748}, journal = {Information Theory, IEEE Transactions on}, keywords = {ber, code, decoder, linear, optimum}, number = {2}, pages = {284--287}, posted-at = {2008-04-10 10:40:05}, priority = {2}, title = {Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1055186}, volume = {20}, year = {1974} }

TY - JOUR ID - citeulike:1377748 L3 - citeulike-article-id:1377748 TI - Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) JF - Information Theory, IEEE Transactions on VL - 20 IS - 2 SP - 284 EP - 287 N2 - 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. KW - ber KW - code KW - decoder KW - linear KW - optimum AU - Bahl, L AU - Cocke, J AU - Jelinek, F AU - Raviv, J PY - 1974/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1055186 ER -