.png){kind=icon}
返回
Index Coding With Coded Side-Information
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2015.2388477.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter investigates a new class of index coding problems. One sender broadcasts packets to multiple users, each desiring a subset, by exploiting prior knowledge of linear combinations of packets. We refer to this class of problems as index coding with coded side-information. Our aim is to characterize the minimum index code length that the sender needs to transmit to simultaneously satisfy all user requests. We show that the optimal binary vector index code length is equal to the minimum rank (minrank) of a matrix whose elements consist of the sets of desired packet indices and side-information encoding matrices. This is the natural extension of matrix minrank in the presence of coded side information. Using the derived expression, we propose a greedy randomized algorithm to minimize the rank of the derived matrix.
Keyword:
Index coding and coded side-information
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Long CAG Repeat Sequence and Protein Expression of Androgen Receptor Considered as Prognostic Indicators in Male Breast Carcinoma.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏Identification of bridged CO2 binding in a Prussian blue analogue using neutron powder diffraction
PREAI
分享收藏 没有更多内容
没有更多内容