• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming
【24h】

Improved Finite Blocklength Converses for Slepian–Wolf Coding via Linear Programming

机译：通过线性规划改进了用于绞车编码的有限块状对话

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

摘要

A new finite blocklength converse for the Slepian-Wolf coding problem, which significantly improves on the best-known converse due to Miyake and Kanaya, is presented. To obtain this converse, an extension of the linear programming (LP)-based framework for finite blocklength point-to-point coding problems is employed. However, a direct application of this framework demands a complicated analysis for the Slepian-Wolf problem. An analytically simpler approach is presented, wherein LP-based finite blocklength converses for this problem are synthesized from point-to-point lossless source coding problems with perfect side-information at the decoder. New finite blocklength converses for these point-to-point problems are derived by employing the LP-based framework, and the new converse for Slepian-Wolf coding is obtained by an appropriate combination of these converses.
机译：展示了一种新的有限块长度，用于斜坡 - 狼编码问题，这显着提高了由于MIYAKE和KANAYA引起的最知名的交谈。为了获得这一关系，采用了基于线性编程（LP）的延伸，用于有限块的有限块重点编码问题的框架。然而，这一框架的直接应用要求对雪狼问题进行复杂的分析。提出了一种分析更简单的方法，其中来自解码器的点对点无损源编码问题的基于LP的有限块长度对话。通过采用基于LP的框架来导出这些点对点问题的新的有限块谈话，并且通过这些对话的适当组合获得了绞车的新逆转。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号