Polar codes for distributed hierarchical source coding

DOI10.3934/AMC.2015.9.87MaRDI QIDQ2018431zbMATH OpenOpenAlexFDO

Authors Min Ye, Alexander Barg

Publication date 14 April 2015

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.5501

zbMATH Keywords

multiple descriptionssuccessive refinementdivisible source

Mathematics Subject Classification ID

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

Abstract: We show that polar codes can be used to achieve the rate-distortion functions in the problem of hierarchical source coding also known as the successive refinement problem. We also analyze the distributed version of this problem, constructing a polar coding scheme that achieves the rate distortion functions for successive refinement with side information.

Recommendations

• Polar codes
• Interactive function computation via polar coding
• Polarization and polar codes
• Rate-adaptive codes for distributed source coding
• Polar codes with higher-order memory

Cites work

• Achievable rates for multiple descriptions
• Achieving Marton’s Region for Broadcast Channels Using Polar Codes
• Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel With a Confidential Component
• Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Estimation of mean error for a discrete successive-approximation scheme
• Hierarchical coding of discrete sources
• Interactive function computation via polar coding
• On Successive Refinement for the Wyner–Ziv Problem
• On the divisibility of discrete sources with an additive single-letter distortion measure
• Polar Codes for $q$-Ary Channels, $q=2^{r}$
• Polar Codes for the $m$-User Multiple Access Channel
• Polar Coding Without Alphabet Extension for Asymmetric Models
• Source and Channel Polarization Over Finite Fields and Reed–Solomon Matrices
• Successive refinement of information
• Successive refinement of information: characterization of the achievable rates
• The rate-distortion function for source coding with side information at the decoder
• The rate-distortion region for multiple descriptions without excess rate

Cited in

(1)

• Interactive function computation via polar coding

This page was built for publication: Polar codes for distributed hierarchical source coding

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