Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate

IEEE Transactions on Information Theory

Volumn 20, Issue 2, 1974, Pages 284-287

  Bahl, L R ^a   Cocke, J ^a   Jelinek, F ^a   Raviv, J ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0016037512     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1974.1055186     Document Type: Article

References (7)

1. A. J. Viterbi “Error bounds for convolutional codes and an asymtotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260–269, Apr. 1967.
2. G. D. Forney, Jr., “Review of random tree codes,” NASA Ames Research Center, Moffett Field, Calif., Appendix A of Final Report on Contract NAS2-3637, NASA CR73176, Dec. 1967.
3. R. W. Chang and J. C. Hancock “On receiver structures for channels having memory,” IEEE Trans. Inform. Theory., vol. IT-12, pp. 463–468, Oct. 1966.
4. L. E. Baum and T. Petrie “Statistical interference for probabilistic functions of finite state markov chains,” Ann. Math. Statist., vol. 37, pp. 1559–1563, 1966.
5. P. L. McAdam, L. R. Welch, and C. L. Weber, “M.A.P. bit decoding of convolutional codes,” presented at the 1972 Int. Symp. Information Theory, Asilomar, Calif.
6. F. Jelinek and J. Cocke “Bootstrap hybrid decoding for symmetrical binary input channels,” Inform. Contr., vol. 18, pp. 261–298, Apr. 1971.
7. G. D. Forney, Jr. “The Viterbi algorithm,” Proc. IEEE, vol. 61, pp. 268–278, Mar. 1973.