Embedded Index Coding

Motivated by applications in distributed storage and distributed computation, we introduce embedded index coding (EIC). EIC is a type of distributed index coding in which nodes in a distributed system act as both senders and receivers of information. We show how embedded index coding is related to index coding in general, and give characterizations and bounds on the communication costs of optimal embedded index codes. We also define task-based EIC, in which each sending node encodes and sends data blocks independently of the other nodes. Task-based EIC is more computationally tractable and has advantages in applications such as distributed storage, in which senders may complete their broadcasts at different times. Finally, we give heuristic algorithms for approximating optimal embedded index codes, and demonstrate empirically that these algorithms perform well.

[1]  Young-Han Kim,et al.  Three stories on a two-sided coin: Index coding, locally recoverable distributed storage, and guessing games on graphs , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[2]  Jae-Won Kim,et al.  Linear Index Coding With Multiple Senders and Extension to a Cellular Network , 2019, IEEE Transactions on Communications.

[3]  Urs Niesen,et al.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[5]  Zhen Zhang,et al.  Dynamic Index Coding for Wireless Broadcast Networks , 2013, IEEE Transactions on Information Theory.

[6]  Yitzhak Birk,et al.  Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients , 2006, IEEE Transactions on Information Theory.

[7]  Robert D. Kleinberg,et al.  Index coding via linear programming , 2010, ArXiv.

[8]  Lawrence Ong,et al.  The Single-Uniprior Index-Coding Problem: The Single-Sender Case and the Multi-Sender Extension , 2016, IEEE Transactions on Information Theory.

[9]  Amin Gohari,et al.  Critical Graphs in Index Coding , 2013, IEEE Journal on Selected Areas in Communications.

[10]  Hooshang Ghasemi,et al.  Improved lower bounds for coded caching , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[11]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2006, IEEE Transactions on Information Theory.

[12]  Lawrence Ong,et al.  Interlinked Cycles for Index Coding: Generalizing Cycles and Cliques , 2016, IEEE Transactions on Information Theory.

[13]  Min Li,et al.  Multi-Sender Index Coding for Collaborative Broadcasting: A Rank-Minimization Approach , 2019, IEEE Transactions on Communications.

[14]  Michael Langberg,et al.  An Equivalence Between Network Coding and Index Coding , 2015, IEEE Trans. Inf. Theory.

[15]  Parastoo Sadeghi,et al.  Distributed index coding , 2016, 2016 IEEE Information Theory Workshop (ITW).

[16]  M.A.R. Chaudhry,et al.  Efficient algorithms for Index Coding , 2008, IEEE INFOCOM Workshops 2008.

[17]  Ishay Haviv.  Task-Based Solutions to Embedded Index Coding , 2020, IEEE Transactions on Information Theory.

[18]  Alexandros G. Dimakis,et al.  Local graph coloring and index coding , 2013, 2013 IEEE International Symposium on Information Theory.

[19]  Lele Wang,et al.  On the capacity region for index coding , 2013, 2013 IEEE International Symposium on Information Theory.

[20]  Alexandros G. Dimakis,et al.  Instantly decodable network codes for real-time applications , 2013, 2013 International Symposium on Network Coding (NetCod).

[21]  Lawrence Ong,et al.  Improved bounds for multi-sender index coding , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[22]  Michael Langberg,et al.  On the complementary Index Coding problem , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[23]  A. Salman Avestimehr,et al.  A Fundamental Tradeoff Between Computation and Communication in Distributed Computing , 2016, IEEE Transactions on Information Theory.

[24]  Arya Mazumdar.  On a duality between recoverable distributed storage and index coding , 2014, 2014 IEEE International Symposium on Information Theory.

[25]  Alexandros G. Dimakis,et al.  Graph theory versus minimum rank for index coding , 2014, 2014 IEEE International Symposium on Information Theory.

[26]  Alexander Sprintson,et al.  On coding for cooperative data exchange , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[27]  V. Lalitha,et al.  On Locally Decodable Index Codes , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[28]  Alexandros G. Dimakis,et al.  Bounding multiple unicasts through index coding and Locally Repairable Codes , 2014, 2014 IEEE International Symposium on Information Theory.

[29]  Uri Stav,et al.  Non-Linear Index Coding Outperforming the Linear Optimum , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[30]  Lawrence Ong,et al.  Cooperative Multi-Sender Index Coding , 2019, IEEE Transactions on Information Theory.

[31]  Alexander Sprintson,et al.  On the relation between the Index Coding and the Network Coding problems , 2008, 2008 IEEE International Symposium on Information Theory.

[32]  Urs Niesen,et al.  Fundamental Limits of Caching , 2014, IEEE Trans. Inf. Theory.