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

DOI10.1109/18.904517zbMATH Open1020.94009OpenAlexW2165856274MaRDI QIDQ4544459FDOQ4544459

Authors: Enhui Yang, Zhen Zhang 

Publication date: 4 August 2002

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

Full work available at URL: https://doi.org/10.1109/18.904517

Recommendations

• The redundancy of source coding with a fidelity criterion. 1. Known statistics
• scientific article
• On the redundancy of lossy source coding with abstract alphabets
• Pointwise redundancy in lossy data compression and universal lossy data compression
• Universal redundancy rates do not exist

zbMATH Keywords

data compressionredundancydistortion rate functionlower mutual informationupper joint entropydistortion raterandom coding argumentuniversal lossy source coding

Mathematics Subject Classification ID

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

Cited In (14)

• Arbitrary source models and Bayesian codebooks in rate-distortion theory
• Pointwise redundancy in lossy data compression and universal lossy data compression
• On bounded redundancy of universal codes
• Convergence of distortion for block coding of symmetric modular sources (Corresp.)
• Universal codes for a class of composite sources (Corresp.)
• Individual redundancy of adaptive and weighted source coding
• Title not available (Why is that?)
• Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding
• On the Asymptotic Redundancy of Lossless Block Coding With Two Codeword Lengths
• Fixed-rate universal lossy source coding and rates of convergence for memoryless sources
• Title not available (Why is that?)
• On the redundancy of trellis lossy source coding
• Joint Fixed-Rate Universal Lossy Coding and Identification of Continuous-AlphabetMemoryless Sources
• Relative-redundancy universal coding of memoryless sources

This page was built for publication: The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics

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