.png){kind=icon}
返回
Critical Graphs in Index Coding
.png){kind=icon}
OA
AI
DOI：10.1109/JSAC.2014.2384294.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we define critical graphs as minimal graphs that support a given set of rates for the index coding problem and study them for both the one-shot and asymptotic setups. For the case of equal rates, we find the critical graph with minimum number of edges for both one-shot and asymptotic cases. For the general case of possibly distinct rates, we show that for one-shot and asymptotic linear index coding, as well as asymptotic nonlinear index coding, each critical graph is a union of disjoint strongly connected subgraphs. On the other hand, we identify a non-USCS critical graph for a one-shot nonlinear index coding problem. Next, we identify a few graph structures that are critical. In addition, we show that the capacity region of the index coding is additive for union of disjoint graphs.
Keyword:
Index coding
critical graphs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
17.2
论文数:
6.4K
被引数:
3.1W
机构
引用论文
.png){kind=icon}
分享收藏Temperature-Constrained Topology Optimization of Transient Heat Conduction Problems瞬态热传导问题的温度约束拓扑优化
PREAI
分享收藏
查看更多内容