Pointwise redundancy in lossy data compression and universal lossy data compression

DOI10.1109/18.817514zbMath0999.94018OpenAlexW2100541918MaRDI QIDQ4503516

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

large deviationsuniversal codingsource codingrate-distortionlossy data compressionone-sided central limit theoremBarron's Lemmapointwise redundancy rates

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)

Related Items (2)

Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources ⋮ Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases

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