Variable-Rate Universal Block Source Coding Subject to a Fidelity Constraint

IEEE Transactions on Information Theory

Volumn 24, Issue 3, 1978, Pages 349-360

  Mackenthun, Kenneth M ^a   Pursley, Michael B ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

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

References (22)

1. M. B. Pursley and L. D. Davisson “Variable rate coding for nonergodic sources and classes of sources subject to a fidelity constraint,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 324–337, May 1976.
2. M. B. Pursley and K. M. Mackenthun “Variable rate coding for classes of sources with generalized alphabets,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 592–597, Sept. 1977.
3. J. C. Kieffer “A generalization of the Pursley-Davisson-Mackenthun variable-rate coding theorem,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 694–697, Nov. 1977.
4. D. L. Neuhoff, R. M. Gray, and L. D. Davisson “Fixed rate universal block source coding with a fidelity criterion,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 511–523, Sept. 1975.
5. L. D. Davisson “Universal noiseless coding,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 783–795, Nov. 1973.
6. L. D. Davisson and M. B. Pursley “A direct proof of the coding theorem for discrete sources with memory,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 310–317, May 1975.
7. T. Berger, Rate Distortion Theory—A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice Hall, 1971.
8. I. A. Ibragimov “Some limit theorems for stationary processes,” Theory of Probability and its Applications, vol. VII, no. 4, pp. 349–382, 1962.
9. M. Rosenblatt “A central limit theorem and a strong mixing condition,” Proc. National Academy of Sciences, vol. 42, pp. 43–47, 1956.
10. P. H. Diananda, “Some probability limit theorems with statistical applications,” Proc. Cambridge Philosophical Society, 49, pp. 239–246, 1953.
11. J. L. Doob, Stochastic Processes. New York: Wiley, 1953.
12. V. A. Volkonskii and Yu A. Rozanov “Some limit theorems for random functions, I,” Theory of Probability and its Applications, vol. IV, no. 2, pp. 178–197, 1959.
13. A. N. Kolmogorov and Yu A. Rozanov “On strong mixing conditions for stationary Gaussian processes,” Theory of Probability and its Applications, vol. V, no. 2, pp. 204–208, 1960.
14. Yu A. Rozanov, Stationary Random Processes. San Francisco: Holden-Day, 1967.
15. J. L. Doob “The elementary Gaussian process,” Annals of Mathematical Statistics, vol. 15, pp. 229–282, 1944.
16. T. E. Harris “On chains of infinite order,” Pacific J. Mathematics, vol. 5, pp. 707–725, 1955.
17. R. M. Gray, D. L. Neuhoff, and P. C. Shields “A generalization of Ornstein's d distance with applications to information theory,” Annals of Probability, vol. 3, pp. 315–328, Apr. 1975.
18. D. L. Neuhoff and P. C. Shields “Fixed-rate universal codes for Markov sources,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 360–367, May 1978.
19. J. Ziv “Coding of sources with unknown statistics—Part II: Distortion relative to a fidelity criterion,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 389–394, May 1972.
20. D. J. Sakrison “The rate of a class of random processes,” IEEE Trans. Inform Theory, vol. IT-16, pp. 10–16, Jan. 1970.
21. P. Billingsley, Convergence of Probability Measures. New York: Wiley, 1968.
22. D. L. Neuhoff, “Optimal source coding for stationary nonergodic sources,” Proc. 13th Ann. Allerton Conf. Circuit and System Theory, pp. 325–334, Oct. 1975.