.png){kind=icon}
返回
Optimal Error Correcting Index Codes for Some Generalized Index Coding Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2018.2878566.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Generalized index coding
Error correcting index coding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
分享收藏Identification of bridged CO2 binding in a Prussian blue analogue using neutron powder diffraction
PREAI
分享收藏
查看更多内容