...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Improved Source Coding Exponents via Witsenhausen's Rate
【24h】

Improved Source Coding Exponents via Witsenhausen's Rate

机译：通过维森豪森氏速率改进源编码指数

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We provide a novel upper-bound on Witsenhausen''s rate, the rate required in the zero-error analogue of the Slepian–Wolf problem. Our bound is given in terms of a new information-theoretic functional defined on a certain graph and is derived by upper bounding complementary graph entropy. We use the functional, along with graph entropy, to give a single letter lower-bound on the error exponent for the Slepian–Wolf problem under the vanishing error probability criterion, where the decoder has full (i.e., unencoded) side information. We demonstrate that our error exponent can beat the “expurgated” source-coding exponent of Csiszár and Körner for some sources that have zeroes in the “channel” matrix connecting the source with the side information. An extension of our scheme to the lossy case (i.e., Wyner–Ziv) is given. For the case in which the side information is a deterministic function of the source, the exponent of our improved scheme agrees with the sphere-packing bound exactly (thus determining the reliability function). An application of our functional to zero-error channel capacity is also given.
机译：我们提供了Wissenhausen利率的新颖上限，该利率是Slepian-Wolf问题的零误差模拟所要求的利率。我们的界线是根据某个图上定义的新的信息理论功能给出的，并由上限互补图熵推导出来。我们使用函数以及图的熵，在消失的错误概率准则下，给出了Slepian-Wolf问题的错误指数的下限单个字母，其中解码器具有完整（即未编码）的边信息。我们证明了对于某些在连接源与辅助信息的“通道”矩阵中具有零的源，我们的错误指数可以超过Csiszár和Körner的“源”编码指数。我们将方案扩展到有损案件（即Wyner-Ziv）。对于辅助信息是源的确定性函数的情况，我们改进方案的指数恰好与球形填充边界一致（从而确定可靠性函数）。还给出了我们的功能到零误差信道容量的应用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号