An efficient SF-ISF approach for the Slepian-Wolf source coding problem

DOI10.1155/ASP.2005.961MaRDI QIDQ2570525zbMATH OpenFDO

Authors Zhenyu Tu, Rick S. Blum, Jing Li Tiffany

Publication date 28 October 2005

Published in EURASIP Journal on Applied Signal Processing (Search for Journal in Brave)

zbMATH Keywords

distributed source codingSlepian-Wolf codingcode binningcompression with side information at the decoderparallelly concatenated convolutional codesserially concatenated convolutional codes

Mathematics Subject Classification ID

Source coding (94A29) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• A general and optimal framework to achieve the entire rate region for Slepian-Wolf coding
• Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression
• Distributed source coding using syndromes (DISCUS): design and construction
• Approaching the Slepian-Wolf boundary using practical channel codes
• On code design for the Slepian-Wolf problem and lossless multiterminal networks

Cited in

(3)

• A general and optimal framework to achieve the entire rate region for Slepian-Wolf coding
• Distributed source coding using syndromes (DISCUS): design and construction
• Approaching the Slepian-Wolf boundary using practical channel codes

This page was built for publication: An efficient SF-ISF approach for the Slepian-Wolf source coding problem

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