A general and optimal framework to achieve the entire rate region for Slepian-Wolf coding

DOI10.1016/J.SIGPRO.2006.03.010MaRDI QIDQ1031405zbMATH OpenOpenAlexFDO

Authors Peiyu Tan, Jing Li Tiffany

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.010

zbMATH Keywords

distributed source coding (DSC)Slepian-Wolf codingsymmetric compression

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• An efficient SF-ISF approach for the Slepian-Wolf source coding problem
• Approaching the Slepian-Wolf boundary using practical channel codes
• An algebraic construction of codes for Slepian-Wolf source networks
• On code design for the Slepian-Wolf problem and lossless multiterminal networks
• Weak Variable-Length Slepian–Wolf Coding With Linked Encoders for Mixed Sources

Cited in

(7)

• An efficient SF-ISF approach for the Slepian-Wolf source coding problem
• Weak Variable-Length Slepian–Wolf Coding With Linked Encoders for Mixed Sources
• On code design for the Slepian-Wolf problem and lossless multiterminal networks
• Slepian-Wolf coding over broadcast channels
• 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
• On the Duality Between Slepian–Wolf Coding and Channel Coding Under Mismatched Decoding

This page was built for publication: A general and optimal framework to achieve the entire rate region for Slepian-Wolf coding

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