Successive refinement of information: characterization of the achievable rates

DOI10.1109/18.272493MaRDI QIDQ4307305zbMATH OpenOpenAlexFDO

Authors Bixio Rimoldi

Publication date 4 October 1994

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

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

zbMATH Keywords

data compressionMarkov conditionprogressive transmissionrate-distortion

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• Successive refinement of information
• On Successive Refinement for the Wyner–Ziv Problem
• All sources are nearly successively refinable
• Notes on Conditions for Successive Refinement of Information
• Notes on Conditions for Successive Refinement of Information

Cited in

(13)

• Polar codes for distributed hierarchical source coding
• Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff
• Notes on Conditions for Successive Refinement of Information
• Two-way successively refined joint source-channel coding
• On Successive Refinement for the Wyner–Ziv Problem
• Additive successive refinement
• On Successive Refinement of the Binary Symmetric Markov Source
• On Successive Refinement With Causal Side Information at the Decoders
• Achievable Rates for Multiple Descriptions With Feed-Forward
• Notes on Conditions for Successive Refinement of Information
• Successive refinement of information
• Stochastic chaining and strengthened information-theoretic generalization bounds
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources

This page was built for publication: Successive refinement of information: characterization of the achievable rates

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