首页> 外文期刊>IEEE Transactions on Information Theory >Strong converses in source coding relative to a fidelity criterion
【24h】

Strong converses in source coding relative to a fidelity criterion

机译:相对于保真度准则而言,源代码中的强烈争议

获取原文
获取原文并翻译 | 示例
           

摘要

Two strong converses are obtained for an abstract alphabet stationary ergodic source coded relative to an appropriate fidelity criterion. It is shown that given a distortion rate point (D,R) that lies below the rate distortion curve, (1) block codes that operate at rate level R must encode sample source blocks at a rate exceeding D with probability tending to one as the block length tends to infinity, and (2) variable-rate codes that operate at distortion level D must encode sample source blocks at a rate exceeding R with probability tending to one as the block length tends to infinity. The previously known weak converses guarantee only that the indicated probabilities remain bounded away from zero as block length tends to infinity. The proofs of the strong converses involve sample converses in source coding theory.
机译:对于相对于适当保真度标准编码的抽象字母平稳遍历源代码,获得了两个强烈的反比。结果表明,在失真率点(D,R)低于速率失真曲线的情况下,(1)以速率级别R运行的块代码必须以超过D的速率对样本源块进行编码,并且概率往往为1。块长度趋于无穷大,并且(2)在失真级别D下运行的可变速率代码必须以超过R的速率对样本源块进行编码,并且随着块长度趋于无穷大,概率趋于于1。先前已知的弱转换仅保证当块长度趋于无穷大时,所指示的概率仍保持远离零的边界。强反演的证明涉及源编码理论中的样本反演。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号