The redundancy of source coding with a fidelity criterion-Part II: Coding at a fixed rate level with unknown statistics

IEEE Transactions on Information Theory

Volumn 47, Issue 1, 2001, Pages 126-145

  Yang, En Hui ^a,b   Zhang, Zhen ^a,c  

^a IEEE

^b UNIVERSITY OF WATERLOO   (Canada)

^c University of Southern California   (United States)

Author keywords

Data compression; Lower mutual information; Random coding argument; Rate distortion (distortion rate) function; Redundancy; Universal lossy source coding; Upper joint entropy

Indexed keywords

ALGORITHMS; BLOCK CODES; BOUNDARY CONDITIONS; DATA COMPRESSION; MATRIX ALGEBRA; REDUNDANCY; SIGNAL DISTORTION; STATISTICS; THEOREM PROVING;

LOWER MUTUAL INFORMATION; RANDOM CODING ARGUMENT; RATE DISTORTION FUNCTION; UNIVERSAL LOSSY SOURCE CODING; UPPER JOINT ENTROPY;

SIGNAL ENCODING;

EID: 0035091471     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.904517     Document Type: Article

References (43)

1. A vector quantization approach to universal noiseless coding and quantization
2. Elements of Information Theory
3. Universal noiseless coding
4. Source coding theorems without the ergodic assumption
5. A generalization of Ornstein's d distance with applications to information theory
6. A unified approach to weak universal source coding
7. A survey of the theory of source coding with a fidelity criterion
8. Three approaches to the quantitative definition of information
9. Logical basis for information theory and probability theory
10. The performance of universal encoding
11. Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding
12. Fixed-rate universal lossy source coding and rates of convergence for memoryless sources
13. On the cost of finite block length in quantizing unbounded memoryless sources
14. On the average redundancy rate of the Lempel-Ziv code
15. Variable-rate universal block source coding subject to a fidelity constraint
16. A comment on "A rate of convergence result for a universal D-semifaithful code"
17. Fixed rate universal block source coding with a fidelity criterion
18. The transmission distortion of a source as a function of the encoding block length
19. Upper bounds on the probability of sequences emitted by finite-state source and on the redundancy of the Lempel-Ziv algorithm
20. Stochastic complexity and modeling
21. Universal coding, information, prediction and estimation
22. Complexity of strings in the class of Markov sources
23. Redundancy of the Lempel-Ziv incremental parsing rule
24. Mathematical theory of communication
25. Universal sequential coding of single messages
26. The redundancy of Markov source encoding
27. Communication of analog data from a Gaussian source over a noisy channel
28. On the transmission of correlated Gaussian data over a noisy channel with finite encoding block length
29. Improved redundancy of a version of the Lempel-Ziv algorithm
30. The redundancy and distribution of the phrase lengths of the fixed database Lempel-Ziv algorithm
31. On the redundancy of the fixed database Lempel-Ziv algorithm for φ-mixing sources
32. An on-line universal lossy data compression algorithm by continuous codebook refinement-Part III: Redundancy analysis
33. The redundancy of source coding with a fidelity criterion-Part III: Coding at a fixed distortion level with unknown statistics
34. On the redundancy of lossy source coding with abstract alphabets
35. A rate of convergence result for a universal D-semifaithful code
36. The redundancy of source coding with a fidelity criterion-Part I: Known statistics
37. An on-line universal lossy data compression algorithm by continuous codebook refinement-Part I: Basic results
38. An on-line universal lossy data compression algorithm via continuous codebook refinement-Part II: Optimality for phi-mixing source models
39. Coding of sources with unknown statistics-Part II: Distortion relative to a fidelity criterion