• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Coding for the Large-Alphabet Adversarial Channel
【24h】

Coding for the Large-Alphabet Adversarial Channel

机译：大字母对抗频道的编码

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

摘要

We consider the problem of encoding an i.i.d. source into a set of symbols or messages that may be altered by an adversary while en route to the decoder. We focus in particular on the regime in which the number of messages is fixed while the blocklength of the source and the size of each message tend to infinity. For this fixed-blocklength, “large alphabet” channel, we show that combining an optimal rate-distortion code with an optimal error-correction code yields an optimal overall code for Gaussian sources with quadratic distortion and binary uniform sources with Hamming distortion but that it can be suboptimal by an arbitrarily large factor in general. We also consider the scenario in which the distortion constraint that the decoder must satisfy depends on the number of errors that occur. We show that the problem can be reduced operationally to one with erasures instead of errors in two special cases: one involving lossless reproduction of functions of the source and one in which the encoder and decoder share common randomness.
机译：我们考虑对i.i.d进行编码的问题。源到一组符号或消息，在到达解码器的过程中可能被对手更改。我们特别关注消息数量固定而源的块长度和每个消息的大小趋于无穷大的机制。对于这个固定块长的“大字母”信道，我们表明将最佳速率失真码与最佳纠错码相结合可产生具有二次失真的高斯源和具有汉明失真的二进制均匀源的最佳总体代码，但是通常，它可以以任意大的因素次优。我们还考虑了解码器必须满足的失真约束取决于发生的错误数量的情况。我们表明，在两种特殊情况下，该问题可以在操作上简化为擦除而不是错误：一种涉及源功能的无损再现，另一种涉及编码器和解码器共享共同的随机性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号