Distributed Source Coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region
Distributed Source Coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region
复制标题
使用阿贝尔群码的分布式源编码：一个新的可实现率失真区域
DOI：
10.1109/tit.2010.2103852
复制
发表时间：
2011
影响因子：
2.5
通讯作者：
S. Pradhan
中科院分区：
文献类型：
--
作者：
Dinesh Krithivasan;S. Pradhan
在这项工作中考虑了一个取决于来源和重建的共同失真标准的分布式源编码问题，而信息理论的普遍趋势是使用Shannon的随机编码参数证明成就结果在此问题上，对于此问题，为此问题提出了一个新的成就率局部区域（内部绑定到绩效限制）基于“良好”结构化的随机嵌套代码在某些来源和失真功能上建立的无内存源，新的速率区域严格大于Berger-Tung率区域对于此问题，这是使用Abelian组代码的单用户编码的数值图表明在任意离散的无内存情况下，嵌套线性代码在任意离散的情况下实现了香农率延伸功能。
A distributed source coding problem with a joint distortion criterion that depends on the sources and the reconstruction is considered in this work. While the prevalent trend in information theory has been to prove achievability results using Shannon's random coding arguments, using structured random codes offer rate gains over unstructured random codes for many problems. Motivated by this, a new achievable rate-distortion region (an inner bound to the performance limit) is presented for this problem for discrete memoryless sources based on “good” structured random nested codes built over abelian groups. For certain sources and distortion functions, the new rate region is shown to be strictly bigger than the Berger-Tung rate region, which has been the best known achievable rate region for this problem till now. This is done using numerical plots. Achievable rates for single-user source coding using abelian group codes are also obtained as a corollary of the main coding theorem. It is shown that nested linear codes achieve the Shannon rate-distortion function in the arbitrary discrete memoryless case.