Approaching the Slepian-Wolf boundary using practical channel codes
From MaRDI portal
Publication:1031402
DOI10.1016/J.SIGPRO.2006.03.018zbMATH Open1172.94410OpenAlexW2104727609MaRDI QIDQ1031402FDOQ1031402
Authors: Javier Garcia-Frias, Felipe Cabarcas 
Publication date: 29 October 2009
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2006.03.018
Recommendations
- On code design for the Slepian-Wolf problem and lossless multiterminal networks
- Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression
- An algebraic construction of codes for Slepian-Wolf source networks
- An efficient SF-ISF approach for the Slepian-Wolf source coding problem
- Distributed source coding using syndromes (DISCUS): design and construction
Cited In (12)
- On the Duality Between Slepian–Wolf Coding and Channel Coding Under Mismatched Decoding
- An efficient SF-ISF approach for the Slepian-Wolf source coding problem
- Slepian-Wolf coding with quantum side information
- Slepian-Wolf coding over broadcast channels
- A general and optimal framework to achieve the entire rate region for Slepian-Wolf coding
- Turbo compression/joint source-channel coding of correlated binary sources with hidden Markov correlation
- Distributed source coding using syndromes (DISCUS): design and construction
- On code design for the Slepian-Wolf problem and lossless multiterminal networks
- Lifetime maximized data gathering in wireless sensor networks using limited-order distributed source coding
- Analysis on crossover probability estimation using LDPC syndrome
- Slepian-Wolf Coded Nested Lattice Quantization for Wyner-Ziv Coding: High-Rate Performance Analysis and Code Design
- An algebraic construction of codes for Slepian-Wolf source networks
Uses Software
This page was built for publication: Approaching the Slepian-Wolf boundary using practical channel codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1031402)
