Joint Source and Noisy Channel Trellis Encoding

IEEE Transactions on Information Theory

Volumn 27, Issue 4, 1981, Pages 516-519

  Dunham, James G ^a   Gray, Robert M ^b  

^a WASHINGTON UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

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

References (15)

1. J. Heller and I. Jacobs, “Viterbi decoding for satellite and space communications,” IEEE Trans. Commun., vol. COM-19, pp. 835–848, 1971.
2. J. L. Massey, Error Bounds for Tree Codes, Trellis Codes and Convolutional Codes with Encoding and Decoding Procedures, C.I.S.M. Lecture Series, Udine, Italy. New York: Springer-Verlag, 1974.
3. G. D. Forney, Jr., “The Viterbi algorithm,” IEEE Proc., vol. 61, pp. 268–278, 1973.
4. F. Jelinek and J. B. Anderson, “Instrumentable tree encoding of informalion sources,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 118–119, 1971.
5. J. B. Anderson and J. B. Bodie, “Tree encoding of speech,” IEEE Trans. Inform. Theory, vol. 1T-21, pp. 379–387, 1974.
6. A. J. Viterbi and J. K. Omura, “Trellis encoding of memoryless discretetime time sources with a fidelity criterion,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 325–332, 1974.
7. R. M. Gray, “Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 71–83, 1977.
8. V. N. Koshelev, “Direct sequential encoding and decoding for discrete sources,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 340–343, 1973.
9. M. E. Hellman, “Convolution source encoding,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 651–656, 1975.
10. R. M. Gray, “Sliding-block source coding,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 357–367, 1975.
11. R. M. Gray and D. S. Ornstein, “Sliding-block joint source/noisy-channel coding theorems,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 682–690, 1976.
12. R. Bellman, Dynamic Programming. Princeton, N.J.: Princeton University Press, 1957.
13. J. G. Dunham, “Source and channel coding theory,” Ph.D. dissertation, Stanford University, Stanford, Calif., Mar. 1978.
14. L. Bahl, J. Cocke, F. Jelinek, and J. Ravin, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 284–287, 1974.
15. Y. Linde and R. M. Gray, “The fake process approach to data compression,” IEEE Trans. Commun., vol. COM-26, pp. 840–849, 1978.