.png){kind=icon}
返回
Binary Informed Source Codes and Index Codes Using Certain Near-MDS Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2018.2789457.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A source coding problem in which a central source has to satisfy the demands of several receivers, with each receiver having some subset of the messages (side-information) held by the source is considered. The source has knowledge of only the cardinality of the side-information at each receiver. The encoding scheme used by the source to transmit at a higher throughput is referred to as an informed source code. A technique to obtain informed source codes by using l-th Near Maximum Distance Separable (Near-MDS) Codes is presented. The advantage of using l-th Near-MDS codes is the reduction in field size required. For certain informed source coding problems, the code obtained from l-th Near-MDS codes is shown to be of the minimum length under certain field size restrictions. The same technique can be used for a given index coding problem to obtain index codes. The index codes obtained through this technique are optimal for, but not limited to, special cases of index coding problems discussed in the paper. Finding an optimal solution to a general index coding problem is NP hard and this technique helps in finding binary suboptimal solutions. Using the Gilbert-Varshamov bound, an upper bound on the lengths of optimal binary informed source codes is obtained.
Keyword:
Index coding
informed source codes
MDS codes
side-information
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
Age and geochemistry of western Hoh-Xil–Songpan-Ganzi granitoids, northern Tibet: Implications for the Mesozoic closure of the Paleo-Tethys ocean: Comment.png)
Lithos
LithosIF0
PREAI
分享收藏分享收藏分享收藏
查看更多内容