Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding

IEEE Transactions on Information Theory

Volumn 48, Issue 2, 2002, Pages 396-415

  Weissman, Tsachy ^a,b   Merhav, Neri ^a,b  

^a IEEE   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Excess code length exponent; Excess distortion exponent; Lossy source coding; Marton's exponent; Noisy source coding; Universal coding

Indexed keywords

DISCRETE MEMORYLESS SOURCE (DMS); LOSSY SOURCE CODING; UNIOVERSAL CODING;

DATA COMPRESSION; INFORMATION THEORY; SIGNAL DISTORTION; SPURIOUS SIGNAL NOISE;

ENCODING (SYMBOLS);

EID: 0036477376     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.978747     Document Type: Article

References (23)

1. Hypothesis testing and information theory
2. Information bounds of the Fano-Kullback type
3. The method of types
4. A unified approach for encoding clean and noisy sources by means of waveform and autoregressive model vector quantization
5. The efficiency of investment information
6. The reliability functions of the general source with fixed-length coding
7. Generalization of Huffman coding to minimize the probability of buffer overflow
8. Buffer overflow in variable length coding of fixed rate sources
9. Error exponents for successive refinement by partitioning
10. A competitive Neyman-Pearson approach to universal hypothesis testing with applications
11. Error exponent for source coding with a fidelity criterion
12. Universal coding with minimum probability of codeword length overflow
13. Coding of sources with two-sided geometric distributions and unknown parameters
14. Optimal prefix codes for sources with two-sided geometric distributions
15. On the probability of buffer overflow under an arbitrary bounded input-output distribution
16. On universal hypotheses testing via large deviations