On the Linear Codebook-Level Duality Between Slepian-Wolf Coding and Channel Coding

被引：17

作者：

Chen, Jun ^{[1
]}

He, Da-ke ^{[2
]}

Jagmohan, Ashish ^{[2
]}

Lastras-Montano, Luis A.

Yang, En-hui ^{[3
]}

机构：

[1] McMaster Univ, Dept Elect & Comp Engn, Hamilton, ON L8S 4K1, Canada

[2] IBM TJ Watson Res Ctr, Yorktown Hts, NY 10598 USA

[3] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2009年 / 55卷 / 12期

关键词：

Channel coding; duality; error exponent; linear code; reliability function; Slepian-Wolf coding; SOURCE NETWORKS; CODES; CAPACITY; THEOREM; EXPONENTS; CONVERSE;

D O I：

10.1109/TIT.2009.2032815

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, it is shown that each Slepian-Wolf coding problem is related to a dual channel coding problem in the sense that the sphere packing exponents, random coding exponents, and correct decoding exponents in these two problems are mirror-symmetrical to each other. This mirror symmetry is interpreted as a manifestation of the linear codebook-level duality between Slepian-Wolf coding and channel coding. Furthermore, this duality, in conjunction with a systematic analysis of the expurgated exponents, reveals that nonlinear Slepian-Wolf codes can strictly outperform linear Slepian-Wolf codes in terms of rate-error tradeoff at high rates. The linear codebook-level duality is also established for general sources and channels.

引用

页码：5575 / 5590

页数：16

共 26 条

[1] GOOD CODES CAN BE PRODUCED BY A FEW PERMUTATIONS
AHLSWEDE, R
DUECK, G
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (03) : 430 - 443
[2] SYNDROME-SOURCE-CODING AND ITS UNIVERSAL GENERALIZATION
ANCHETA, TC
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (04) : 432 - 436
[3] [Anonymous], 1981, Information Theory: Coding Theorems for Discrete Memoryless Systems
[4] CONVERSE TO CODING THEOREM FOR DISCRETE MEMORYLESS CHANNELS
ARIMOTO, S
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (03) : 357 - 359
[5] LINEAR BLOCK-CODES OVER CYCLIC GROUPS
CAIRE, G
BIGLIERI, E
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (05) : 1246 - 1256
[6] On the Duality Between Slepian-Wolf Coding and Channel Coding Under Mismatched Decoding
Chen, Jun
He, Da-ke
Jagmohan, Ashish
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (09) : 4006 - 4018
[7] PROOF OF DATA COMPRESSION THEOREM OF SLEPIAN AND WOLF FOR ERGODIC SOURCES
COVER, TM
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (02) : 226 - 228
[8] TOWARDS A GENERAL-THEORY OF SOURCE NETWORKS
CSISZAR, I
KORNER, J
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (02) : 155 - 165
[9] LINEAR CODES FOR SOURCES AND SOURCE NETWORKS - ERROR EXPONENTS, UNIVERSAL CODING
CSISZAR, I
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (04) : 585 - 592
[10] GRAPH DECOMPOSITION - A NEW KEY TO CODING THEOREMS
CSISZAR, I
KORNER, J
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (01) : 5 - 12

← 1 2 3 →