Computation of Channel Capacity and Rate-Distortion Functions

IEEE Transactions on Information Theory

Volumn 18, Issue 4, 1972, Pages 460-473

  Blahut, Richard E ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY-COMMUNICATION CHANNELS;

RATE-DISTORTION FUNCTIONS;

INFORMATION THEORY;

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

References (13)

1. C. Shannon, “A mathematical theory of communication,” Bell Syst, Tech. J., vol. 27, pp. 379–423, 623–656, 1948.
2. C. Shannon, “Coding theorems for a discrete source with a fidelity criterion” in 1959 IRE Nat. Conv. Rec. pt. 4. pp. 142–163.
3. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
4. F. Jelinek, Probabilistic Information Theory. New York: McGraw-HilL 1968.
5. T. Berger, Rrate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, N.J.: Prentice-Hall, 1971.
6. B. G. Haskell, “The computation and bounding of rate-distortion functions,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 525–531, Seot. 1969.
7. R. L. Dobrushin, “Mathematical problems in the Shannon theory of optimal coding of information,” in Proc. 4th Berkeley Symp. Mathematical Statistics and Probability, vol. 1. Berkeley and Los Angeles: Univ. California Press, 1962. pp. 211–252.
8. T.J. Gobick Jr., “Coding for a discrete information source with a distortion measure,” Ph.D. dissertation, Dep. Elec. Eng., M.I.T., Cambridge. Mass. 1962.
9. T. Bemrger, “Nyquist's problem in data transmission,” Ph.D. dissertation. Harvard Univ., Cambridge. Mass. 1965.
10. R. M. Gray, “Information rates of autoregressive sources,” PhD dissertation Univ Southern California. Los Angeles.
11. A. D. Wyner and J. Ziv, “Bounds on the rate-distortion function for stationary sources with memory,” IEEE Trans Inform. Theory, vol. IT-17, pp. 508–513, Sept. 1971.
12. R. E. Blahut, “Computation of information measures,” Ph.D. dissertation. Cornell Univ., Ithaca. N.Y. 1972.
13. S. Arimoto, “An algorithm for computing the capacity of arbitrary discrete memoryless channels,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 14–20, Jan. 1972.