Pointwise redundancy in lossy data compression and universal lossy data compression

DOI10.1109/18.817514MaRDI QIDQ4503516zbMATH OpenOpenAlexFDO

Authors Ioannis Kontoyiannis

Publication date 7 September 2000

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/954bffad59ee0b39ad86885579f93b1cb8d8ef62

zbMATH Keywords

Barron's Lemmalarge deviationslossy data compressionone-sided central limit theorempointwise redundancy ratesrate-distortionsource codinguniversal coding

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics
• An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
• On the redundancy of lossy source coding with abstract alphabets
• The redundancy of source coding with a fidelity criterion. 1. Known statistics
• Achievable complexity-performance tradeoffs in lossy compression

Cited in

(10)

• Achievable complexity-performance tradeoffs in lossy compression
• Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
• On the Asymptotic Redundancy of Lossless Block Coding With Two Codeword Lengths
• The redundancy of source coding with a fidelity criterion. 1. Known statistics
• Fixed-slope universal lossy data compression
• The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics
• Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
• Arbitrary source models and Bayesian codebooks in rate-distortion theory
• An on-line universal lossy data compression algorithm via continuous codebook refinement .III. Redundancy analysis
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources

This page was built for publication: Pointwise redundancy in lossy data compression and universal lossy data compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503516)