Fundamentals of Index Coding

被引:39
作者
Arbabjolfaei, Fatemeh [1 ]
Kim, Young-Han [1 ]
机构
[1] Univ Calif San Diego, Dept Elect & Comp Engn, San Diego, CA 92103 USA
来源
FOUNDATIONS AND TRENDS IN COMMUNICATIONS AND INFORMATION THEORY | 2018年 / 14卷 / 3-4期
基金
美国国家科学基金会;
关键词
D O I
10.1561/0100000094
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Index coding is a canonical problem in network information theory that studies the fundamental limit and optimal coding schemes for broadcasting multiple messages to receivers with different side information. The index coding problem provides a simple yet rich model for several important engineering tasks such as satellite communication, content broadcasting, distributed caching, device-to-device relaying, and interference management. This monograph aims to provide a broad overview of this fascinating subject, focusing on the simplest form of multiple-unicast index coding. A unified treatment on coding schemes based on graph-theoretic, algebraic, and information-theoretic approaches is presented. Although the problem of characterizing the optimal communication rate is open in general, several bounds and structural properties are established. The relationship to other problems such as network coding and distributed storage is also discussed.
引用
收藏
页码:164 / 346
页数:184
相关论文
共 167 条
[1]  
Agarwal A., 2018, LINEAR PROGRAMMING A
[2]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[3]   Source coding and graph entropies [J].
Alon, N ;
Orlitsky, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (05) :1329-1339
[4]   Approximating the independence number via the θ-function [J].
Alon, N ;
Kahale, N .
MATHEMATICAL PROGRAMMING, 1998, 80 (03) :253-264
[5]   Broadcasting with side information [J].
Alon, Noga ;
Hassidim, Avinatan ;
Lubetzky, Eyal ;
Stav, Uri ;
Weinstein, Amit .
PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, :823-+
[6]  
[Anonymous], 2013, THESIS
[7]  
[Anonymous], [No title captured]
[8]  
[Anonymous], 1998, DIRECTED INFORM CHAN
[9]  
[Anonymous], [No title captured]
[10]   EVERY PLANAR MAP IS 4 COLORABLE .2. REDUCIBILITY [J].
APPEL, K ;
HAKEN, W ;
KOCH, J .
ILLINOIS JOURNAL OF MATHEMATICS, 1977, 21 (03) :491-567