Slepian-Wolf coding over broadcast channels
From MaRDI portal
Publication:3547734
DOI10.1109/TIT.2006.871609zbMATH Open1318.94053OpenAlexW2129504043MaRDI QIDQ3547734FDOQ3547734
Authors: Ertem Tuncel
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2006.871609
Recommendations
- Slepian–Wolf Coding Over Cooperative Relay Networks
- Approaching the Slepian-Wolf boundary using practical channel codes
- On the Duality Between Slepian–Wolf Coding and Channel Coding Under Mismatched Decoding
- On the Linear Codebook-Level Duality Between Slepian–Wolf Coding and Channel Coding
- A general and optimal framework to achieve the entire rate region for Slepian-Wolf coding
- Coding Theorems for Asynchronous Slepian–Wolf Coding Systems
- Distributed Arithmetic Coding for the Slepian–Wolf Problem
- Random-coding bounds for some broadcast channels
- On code design for the Slepian-Wolf problem and lossless multiterminal networks
- On the Redundancy of Slepian–Wolf Coding
Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)
Cited In (4)
- On the Duality Between Slepian–Wolf Coding and Channel Coding Under Mismatched Decoding
- Impact of private observation in the Bayesian persuasion game
- On code design for the Slepian-Wolf problem and lossless multiterminal networks
- Slepian-Wolf Coded Nested Lattice Quantization for Wyner-Ziv Coding: High-Rate Performance Analysis and Code Design
This page was built for publication: Slepian-Wolf coding over broadcast channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547734)