Error exponents for successive refinement by partitioning

IEEE Transactions on Information Theory

Volumn 42, Issue 1, 1996, Pages 275-282

  Kanlis, Angelos ^a   Narayan, Prakash ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Covering Lemma; Error exponent; Rate distortion function; Successive refinement by partitioning

Indexed keywords

CODES (SYMBOLS); ENCODING (SYMBOLS); ERROR ANALYSIS; FUNCTIONS; PROBABILITY; SIGNAL DISTORTION;

COVERING LEMMA; DISCRETE MEMORYLESS SOURCE; ERROR EXPONENTS; PARTITIONING; PROBABILITY MASS FUNCTION; RATE DISTORTION FUNCTION; SUCCESSIVE REFINEMENT;

INFORMATION THEORY;

EID: 0029769149     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.481803     Document Type: Article

References (20)

1. R. Ahlswede, "The rate-distortion region for multiple descriptions," IEEE Trans. Inform. Theory, vol. IT-31, no. 6, pp. 721-726, Nov. 1985.
2. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic Press, 1981.
3. A. El Gamal and T. M. Cover, "Achievable rates for multiple descriptions," IEEE Trans. Inform. Theory, vol. IT-28, no. 6, pp. 851-857, Nov. 1982.
4. W. H. Equitz and T. M. Cover, "Successive refinement of information," IEEE Trans. Inform. Theory, vol. 37, no. 2, pp. 269-275, Mar. 1991.
5. _, "Addendum to 'Successive refinement of information'," IEEE Trans. Inform. Theory, vol. 39, no. 4, pp. 1465-1466, July 1993.
6. R. M. Gray, "A new class of lower bounds to information rates of stationary sources via conditional rate-distortion functions," IEEE Trans. Inform. Theory, vol. IT-19, no. 4, pp. 480-489, July 1973.
7. _, "Conditional rate-distortion theory," Tech. Rep. 6502-2, Stanford Electronics Lab., Stanford Univ., Stanford, CA, Oct. 1972.
8. A. H. Kaspi and T. Berger, "Rate-distortion for correlated sources with partially separated encoders," IEEE Trans. Inform. Theory, vol. IT-28, no. 6, pp. 828-840, Nov. 1982.
9. V. Koshélev, "Estimation of mean error for a discrete successive-approximation scheme," Probl. Pered. Informat., vol. 17, no. 3, pp. 20-33, July-Sept., 1981.
10. _, "Hierarchical coding of discrete sources," Probl. Pered. Informat., vol. 16, no. 3, pp. 31-49, 1980.
11. K. Marton, "Error exponent for source coding with a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT-20, pp. 197-199, 1974.
12. J. K. Omura, "Coding theorem for discrete-time sources," IEEE Trans. Inform. Theory, vol. IT-19, no. 4, pp. 490-497, July 1973.
13. _, "A lower hounding method for channel and source coding probabilities," Inform. Contr., vol. 27, pp. 148-177, 1975.
14. L. Ozarow, "On a source-coding problem with two channels and three receivers," Bell Syst. Tech. J., vol. 59, no. 10, pp. 1909-1921, Dec. 1980.
15. B. Rimoldi, "Successive refinement of information: Characterization of the achievable rates," IEEE Trans. Inform. Theory, vol 40, no. 1, pp. 253-259, Jan. 94.
16. T. R. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
17. H. S. Witsenhausen and A. D. Wyner, "Source coding for multiple descriptions II: A binary source," Bell Syst. Tech. J., vol. 60, no. 10, pp. 2281-2292, Dec. 1981.
18. J. K. Wolf, A. D. Wyner, and J. Ziv, "Source coding for multiple description," Bell Syst. Tech. J., vol. 60. no. 10, pp. 2281-2292. Dec. 1981.
19. H. Yamamoto, "Source coding theory for cascade and branching communication systems," IEEE Trans. Inform. Theory, vol. IT-27, no. 3, pp. 299-308, May 1981.
20. Z. Zhang and T. Berger, "New results in binary multiple descriptions," IEEE Trans. Inform. Theory, vol. IT-33, no. 4, pp. 502-521, July 1987.