DocumentCode
1865317
Title
On the Codebook-Level Duality Between Slepian-Woif Coding and Channel Coding
Author
Chen, Jun ; He, Da-Ke ; Yang, En-Hui
Author_Institution
IBM T. J. Watson Res. Center, Yorktown
fYear
2007
fDate
Jan. 29 2007-Feb. 2 2007
Firstpage
84
Lastpage
93
Abstract
A codebook-level duality between Slepian-Wolf coding and channel coding is established. Specifically, it is shown that using linear codes over Z M (the ring of integers mod M), each Slepian-Wolf coding problem is equivalent to a channel coding problem for a semi-symmetric additive channel under optimal decoding, belief propagation decoding, and minimum entropy decoding. Various notions of symmetric channels are discussed and their connections with semi-symmetric additive channels are clarified.
Keywords
channel coding; decoding; entropy codes; minimum entropy methods; Slepian-Wolf coding; belief propagation decoding; channel coding; codebook-level duality; linear code; minimum entropy decoding; optimal decoding; semi-symmetric additive channel; symmetric channel; Channel coding; Entropy; Error probability; Helium; Linear code; Maximum likelihood decoding; Parity check codes; Probability distribution; Random variables; Zinc;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Applications Workshop, 2007
Conference_Location
La Jolla, CA
Print_ISBN
978-0-615-15314-8
Type
conf
DOI
10.1109/ITA.2007.4357566
Filename
4357566
Link To Document