Arbitrary source models and Bayesian codebooks in rate-distortion theory

IEEE Transactions on Information Theory

Volumn 48, Issue 8, 2002, Pages 2276-2290

  Kontoyiannis, Ioannis ^a,b   Zhang, Junshan ^a,c  

^a IEEE   (United States)

^b Brown Univerity   (United States)

^c Arizona State University   (United States)

Author keywords

Data compression; Mixture codebooks; Rate distortion theory; Redundancy rate

Indexed keywords

MIXTURE CODEBOOKS; RATE DISTORTION THEORY; REDUNDANCY RATE;

ALGORITHMS; CODES (SYMBOLS); DATA COMPRESSION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; REDUNDANCY;

INFORMATION THEORY;

EID: 0036671690     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.800493     Document Type: Article

References (36)

1. Logically smooth density estimation
2. The minimum description length principle in coding and modeling. (Information theory: 1948-1998)
3. Game-theoretic optimal portfolios
4. A vector quantization approach to universal noiseless coding and quantizations
5. Information-theoretic asymptotics of Bayes methods
6. Universal noiseless coding
7. The asymptotics of waiting times between stationary processes, allowing distortion
8. Source coding, large deviations, and approximate pattern matching
9. Universal codeword sets and representations of the integers
10. An information-spectrum approach to source coding theorems with a fidelity criterion
11. The redundancy of universal coding with a fidelity criterion
12. On the practical implication of mutual information for statistical decision making
13. An almost sure convergence theorem for sequences of random variables selected from log-convex sets
14. Sample converses in source coding theory
15. An implementable lossy version of the Lempel-Ziv algorithm-Part I: Optimality for memoryless sources
16. Model selection via rate-distortion theory
17. Pointwise redundancy in lossy data compression and universal lossy data compression
18. A suboptimal lossy data compression algorithm based on approximate pattern matching
19. Stochastic complexity
20. Coding theorems for a discrete source with a fidelity criterion
21. Simulation of random processes and rate-distortion theory
22. On the performance of data compression algorithms based upon string matching
23. The redundancy of source coding with a fidelity criterion-Part III: Coding at a fixed distortion level with unknown statistics
24. On the redundancy of lossy source coding with abstract alphabets
25. The redundancy of source coding with a fidelity criterion-Part II: Coding at a fixed rate level with unknown statistics
26. A rate of convergence result for a universal D-semifaithful code
27. An information criterion for likelihood selection
28. A type generator model for adaptive lossy compression
29. Natural type selection in adaptive lossy compression
30. The redundancy of source coding with a fidelity criterion-Part I: Known statistics
31. Coding theorems for a discrete source with a fidelity criterion