首页> 外文期刊>IEEE Transactions on Communications >Optimal Error Correcting Index Codes for Some Generalized Index Coding Problems
【24h】

Optimal Error Correcting Index Codes for Some Generalized Index Coding Problems

机译:广义索引编码问题的最佳纠错索引码

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

摘要

The index coding with side-information problem introduced by Birk and Kol has been generalized to the case, where the transmissions are subjected to errors by Dau et al.. Lower and upper bounds on the optimal number of transmissions required to correct a specified number delta of errors were established. In another generalization of index coding problem, namely, generalized index coding (GIC) problem introduced by Dai et al., linear combination of the messages can be demanded and held as side information by the receivers. Error correction for GIC problems was studied and the bounds for optimal number of transmissions required for delta-error correcting generalized index codes were established by Byrne and Calderini. In this paper, for a particular class of GIC problems construction of optimal scalar linear index codes are discussed. For this class of GIC problems, the optimal linear delta-error correcting index codes are also constructed. As special cases, optimal linear error correcting codes are obtained for two classes of original index coding problems, namely, single-prior index coding problems and single unicast index coding problems with symmetric neighboring consecutive side information.
机译:由Birk和Kol引入的带有旁信息问题的索引编码已被推广到以下情况:Dau等人对传输进行了错误处理。校正指定数量delta所需的最佳传输次数的上限和下限错误已建立。在索引编码问题的另一种概括,即由Dai等人提出的广义索引编码(GIC)问题中,接收器可以要求消息的线性组合并将其保持为辅助信息。研究了GIC问题的纠错,并由Byrne和Calderini建立了用于纠错广义索引代码所需的最佳传输次数的界限。在本文中,针对特定类别的GIC问题,讨论了最佳标量线性索引代码的构造。对于此类GIC问题,还构造了最佳线性增量误差校正索引代码。作为特殊情况,针对两类原始索引编码问题,即具有对称相邻连续边信息的单优先索引编码问题和单单播索引编码问题,获得了最佳线性纠错码。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号