A Successive Description property of Monotone-Chain Polar Codes for Slepian-Wolf coding
We introduce a property that we call Successive Description property for Slepian Wolf coding. We show that Monotone-Chain Polar Codes can be used to construct low-complexity codes that satisfy this property. We discuss applications of this property to network coding problems.
Main Authors: | Salamatian, Salman, Medard, Muriel, Telatar, Emre |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2016
|
Online Access: | http://hdl.handle.net/1721.1/100949 https://orcid.org/0000-0003-4059-407X |
Similar Items
-
On the Reliability Function of Variable-Rate Slepian-Wolf Coding
by: Jun Chen, et al.
Published: (2017-07-01) -
Symbol positions‐based Slepian–Wolf coding with application to distributed video coding
by: Said Benierbah, et al.
Published: (2020-09-01) -
An Efficient SF-ISF Approach for the Slepian-Wolf Source Coding Problem
by: Tu Zhenyu, et al.
Published: (2005-01-01) -
Greedy Iterative and Meta-Heuristic Clustering With Coded Caching and Slepian-Wolf Compression for Correlated Content
by: Benjamin Rosen, et al.
Published: (2024-01-01) -
Trade-offs between Error Exponents and Excess-Rate Exponents of Typical Slepian–Wolf Codes
by: Ran Tamir (Averbuch), et al.
Published: (2021-02-01)