{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T22:32:58Z","timestamp":1777761178768,"version":"3.51.4"},"reference-count":170,"publisher":"Emerald","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10,17]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1561\/0100000094","type":"journal-article","created":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T05:54:43Z","timestamp":1539755683000},"page":"163-346","source":"Crossref","is-referenced-by-count":49,"title":["Fundamentals of Index Coding"],"prefix":"10.1108","volume":"14","author":[{"given":"Fatemeh","family":"Arbabjolfaei","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California ,","place":["San Diego"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young-Han","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California ,","place":["San Diego"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"key":"2026032712272909600_ref001","unstructured":"Agarwal, A., L.Flodin, and A.Mazumdar (2018). \u201cLinear programming approximations for index coding\u201d. URL: http:\/\/arxiv.org\/abs\/1807.07193."},{"issue":"4","key":"2026032712272909600_ref002","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","article-title":"Network information flow","volume":"46","author":"Ahlswede","year":"2000","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref003","first-page":"823","volume-title":"Proc. 49th Ann. IEEE Symp. Found. Comput. Sci","author":"Alon","year":"2008"},{"issue":"3","key":"2026032712272909600_ref004","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01581168","article-title":"Approximating the independence number via the \u0398-function","volume":"80","author":"Alon","year":"1998","journal-title":"Math. Prog."},{"issue":"5","key":"2026032712272909600_ref005","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1109\/18.532875","article-title":"Source coding and graph entropies","volume":"42","author":"Alon","year":"1996","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"3","key":"2026032712272909600_ref006","first-page":"491567","article-title":"Every planar map is four colorable-II: Reducibility","volume":"21","author":"Appel","year":"1977","journal-title":"Illinois J. Math."},{"key":"2026032712272909600_ref007","first-page":"1","article-title":"Index coding via random coding","author":"Arbabjolfaei","year":"2014","journal-title":"Proc. 2nd Iran Workshop Commun. Inf. Theory. Tehran, Iran."},{"key":"2026032712272909600_ref008","first-page":"962","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Arbabjolfaei","year":"2013"},{"key":"2026032712272909600_ref009","first-page":"286","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Arbabjolfaei","year":"2014"},{"key":"2026032712272909600_ref010","volume-title":"Ph.D. Thesis","author":"Arbabjolfaei","year":"2017"},{"key":"2026032712272909600_ref011","first-page":"9","volume-title":"Proc. IEEE Inf. Theory Workshop","author":"Arbabjolfaei","year":"2015"},{"key":"2026032712272909600_ref012","first-page":"1034","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Arbabjolfaei","year":"2015"},{"key":"2026032712272909600_ref013","first-page":"843","volume-title":"Proc. 53rd Ann. Allerton Conf. Comm. Control Comput","author":"Arbabjolfaei","year":"2015"},{"key":"2026032712272909600_ref014","first-page":"2154","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Arbabjolfaei","year":"2016"},{"key":"2026032712272909600_ref015","unstructured":"Arbabjolfaei, F. and Y.-H.Kim (2017). \u201cGeneralized lexicographic products and the index coding capacity\u201d. url: http:\/\/arxiv.org\/abs\/1608.03689."},{"key":"2026032712272909600_ref016","unstructured":"Arbabjolfaei, F., Y.-H.Kim, and P.Sadeghi (2018). \u201cGitHub index coding repository\u201d. url: http:\/\/github.com\/index-coding."},{"issue":"10","key":"2026032712272909600_ref017","doi-asserted-by":"crossref","first-page":"5490","DOI":"10.1109\/TIT.2015.2463277","article-title":"Optimal coding schemes for the three-receiver AWGN broadcast channel with receiver message side information","volume":"61","author":"Asadi","year":"2015","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref018","first-page":"1","volume-title":"Proc. Int. Symp. Netw. Coding","author":"Baber","year":"2013"},{"key":"2026032712272909600_ref019","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58152-6","volume-title":"Linear Programming Duality: An Introduction to Oriented Matroids","author":"Bachem","year":"1992"},{"issue":"3","key":"2026032712272909600_ref020","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1109\/TIT.2018.2791994","article-title":"The capacity of private information retrieval from coded databases","volume":"64","author":"Banawan","year":"2018","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"12","key":"2026032712272909600_ref021","doi-asserted-by":"crossref","first-page":"6536","DOI":"10.1109\/TIT.2015.2476792","article-title":"Optimal achievable rates for interference networks with random codes","volume":"61","author":"Bandemer","year":"2015","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref022","first-page":"197","volume-title":"Proc. 47th Ann. IEEE Symp. Found. Comput. Sci","author":"Bar-Yossef","year":"2006"},{"issue":"3","key":"2026032712272909600_ref023","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1109\/TIT.2010.2103753","article-title":"Index coding with side information","volume":"57","author":"Bar-Yossef","year":"2011","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref024","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.dam.2014.03.016","article-title":"Graph classes and Ramsey numbers","volume":"173","author":"Belmonte","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"2026032712272909600_ref025","first-page":"806","volume-title":"Proc. IEEE Int. Symp. Inf. Theory. Saint","author":"Berliner","year":"2011"},{"key":"2026032712272909600_ref026","first-page":"1257","volume-title":"Proc. 17th Ann. IEEE Int. Conf. Comput. Commun. (INFOCOM)","author":"Birk","year":"1998"},{"issue":"6","key":"2026032712272909600_ref027","doi-asserted-by":"crossref","first-page":"2825","DOI":"10.1109\/TIT.2006.874540","article-title":"Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients","volume":"52","author":"Birk","year":"2006","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"4","key":"2026032712272909600_ref028","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1214\/aoms\/1177706106","article-title":"The capacity of a class of channels","volume":"30","author":"Blackwell","year":"1959","journal-title":"Ann. Math. Statist."},{"key":"2026032712272909600_ref029","first-page":"609","volume-title":"Proc. 52nd Ann. IEEE Symp. Found. Comput. Sci.","author":"Blasiak","year":"2011"},{"issue":"9","key":"2026032712272909600_ref030","doi-asserted-by":"crossref","first-page":"5811","DOI":"10.1109\/TIT.2013.2264472","article-title":"Broadcasting with side information: Bounding and approximating the broadcast rate","volume":"59","author":"Blasiak","year":"2013","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref031","volume-title":"PhD thesis","author":"Blasiak","year":"2013"},{"issue":"11","key":"2026032712272909600_ref032","doi-asserted-by":"crossref","first-page":"6192","DOI":"10.1109\/TIT.2015.2477821","article-title":"Pliable index coding","volume":"61","author":"Brahma","year":"2015","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"6","key":"2026032712272909600_ref033","doi-asserted-by":"crossref","first-page":"3712","DOI":"10.1109\/TIT.2017.2687933","article-title":"Error correction for index coding with coded side information","volume":"63","author":"Byrne","year":"2017","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref034","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-319-70293-3_10","volume-title":"Network Coding and Subspace Designs","author":"Byrne","year":"2018"},{"issue":"8","key":"2026032712272909600_ref035","doi-asserted-by":"crossref","first-page":"3425","DOI":"10.1109\/TIT.2008.926344","article-title":"Interference alignment and degrees of freedom of the K-user interference channel","volume":"54","author":"Cadambe","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2026032712272909600_ref036","doi-asserted-by":"crossref","first-page":"2974","DOI":"10.1109\/TIT.2013.2237752","article-title":"Asymptotic interference alignment for optimal repair of MDS codes in distributed storage","volume":"59","author":"Cadambe","year":"2013","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"3","key":"2026032712272909600_ref037","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1109\/JPROC.2010.2094592","article-title":"Theory of secure network coding","volume":"99","author":"Cai","year":"2011","journal-title":"Proc. IEEE."},{"key":"2026032712272909600_ref038","first-page":"323","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Cai","year":"2002"},{"issue":"1","key":"2026032712272909600_ref039","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1109\/TIT.2010.2090197","article-title":"Secure network coding on a wiretap network","volume":"57","author":"Cai","year":"2011","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"1","key":"2026032712272909600_ref040","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1109\/PROC.1978.10848","article-title":"On increasing the downlink capacity of a regenerative satellite repeater in point-to-point communications","volume":"66","author":"Celebiler","year":"1978","journal-title":"Proc. IEEE."},{"issue":"10","key":"2026032712272909600_ref041","doi-asserted-by":"crossref","first-page":"4470","DOI":"10.1109\/TIT.2008.928963","article-title":"Dualities between entropy functions and network codes","volume":"54","author":"Chan","year":"2008","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref042","first-page":"2378","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Chan","year":"2010"},{"key":"2026032712272909600_ref043","first-page":"433","article-title":"Planar permutation graphs","volume":"3","author":"Chartrand","year":"1967","journal-title":"Ann. Inst. H. Poincar\u00e9 B."},{"key":"2026032712272909600_ref044","first-page":"244","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Chaudhry","year":"2011"},{"key":"2026032712272909600_ref045","first-page":"41","volume-title":"36th Ann. IEEE Symp. Found. Comp. Sci","author":"Chor","year":"1995"},{"issue":"1","key":"2026032712272909600_ref046","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","article-title":"The strong perfect graph theorem","volume":"164","author":"Chudnovsky","year":"2006","journal-title":"Ann. Math."},{"key":"2026032712272909600_ref047","first-page":"153","volume-title":"Surv. Combin.","author":"Chudnovsky","year":"2005"},{"key":"2026032712272909600_ref048","volume-title":"Ph.D. Thesis","author":"Connelly","year":"2018"},{"issue":"1","key":"2026032712272909600_ref049","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TIT.1972.1054727","article-title":"Broadcast channels","volume":"18","author":"Cover","year":"1972","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref050","volume-title":"Elements of Information Theory. Second","author":"Cover","year":"2006"},{"issue":"9","key":"2026032712272909600_ref051","doi-asserted-by":"crossref","first-page":"1536","DOI":"10.1109\/TWC.2014.2330571","article-title":"Data dissemination with side information and feedback","volume":"13","author":"Dai","year":"2014","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"6","key":"2026032712272909600_ref052","doi-asserted-by":"crossref","first-page":"3975","DOI":"10.1109\/TIT.2012.2188777","article-title":"On the security of index coding with side information","volume":"58","author":"Dau","year":"2012","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"3","key":"2026032712272909600_ref053","doi-asserted-by":"crossref","first-page":"1517","DOI":"10.1109\/TIT.2012.2227674","article-title":"Error correction for index coding with side information","volume":"59","author":"Dau","year":"2013","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"12","key":"2026032712272909600_ref054","first-page":"1","article-title":"Optimum information transmission through a channel with unknown parameters","volume":"4","author":"Dobrushin","year":"1959","journal-title":"Radio Eng. Electron."},{"issue":"6","key":"2026032712272909600_ref055","doi-asserted-by":"crossref","first-page":"2365","DOI":"10.1109\/TIT.2006.874405","article-title":"Unachievability of network coding capacity","volume":"52","author":"Dougherty","year":"2006","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"3","key":"2026032712272909600_ref056","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/JPROC.2010.2095490","article-title":"Network coding and matroid theory","volume":"99","author":"Dougherty","year":"2011","journal-title":"Proc. IEEE."},{"key":"2026032712272909600_ref057","unstructured":"Dougherty, R., C.Freiling, and K.Zeger (2011b). \u201cNon-Shannon information inequalities in four random variables\u201d. URL: http:\/\/arxiv.org\/abs\/1104.3602."},{"issue":"8","key":"2026032712272909600_ref058","doi-asserted-by":"crossref","first-page":"2745","DOI":"10.1109\/TIT.2005.851744","article-title":"Insufficiency of linear coding in network information flow","volume":"51","author":"Dougherty","year":"2005","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"1","key":"2026032712272909600_ref059","first-page":"11","article-title":"Maximal error capacity regions are smaller than average error capacity regions for multi-user channels","volume":"7","author":"Dueck","year":"1978","journal-title":"Probl. Control Inf. Theory."},{"issue":"5","key":"2026032712272909600_ref060","doi-asserted-by":"crossref","first-page":"2478","DOI":"10.1109\/TIT.2015.2414926","article-title":"An equivalence between network coding and index coding","volume":"61","author":"Effros","year":"2015","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref061","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139030687","volume-title":"Network Information Theory","author":"El Gamal","year":"2011"},{"issue":"7","key":"2026032712272909600_ref062","doi-asserted-by":"crossref","first-page":"3187","DOI":"10.1109\/TIT.2010.2048502","article-title":"On the index coding problem and its relation to network coding and matroid theory","volume":"56","author":"El Rouayheb","year":"2010","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref063","first-page":"120","volume-title":"Proc. IEEE Inf. Theory Workshop","author":"El Rouayheb","year":"2007"},{"key":"2026032712272909600_ref064","volume-title":"PhD thesis","author":"El Rouayheb","year":"2009"},{"issue":"3","key":"2026032712272909600_ref065","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1109\/TIT.2011.2173631","article-title":"Secure network coding for wiretap networks of type II","volume":"58","author":"El Rouayheb","year":"2012","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"1","key":"2026032712272909600_ref066","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(86)90065-8","article-title":"Coloring graphs with locally few colors","volume":"59","author":"Erd\u00f6s","year":"1986","journal-title":"Discrete Math"},{"key":"2026032712272909600_ref067","first-page":"125","article-title":"On the representation of directed graphs as unions of orderings","volume":"9","author":"Erd\u00f6s","year":"1964","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"2026032712272909600_ref068","first-page":"463","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erd\u00f6s","year":"1935","journal-title":"Compositio Math"},{"issue":"1","key":"2026032712272909600_ref069","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/BF01504345","article-title":"Uber die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koeffizienten","volume":"17","author":"Fekete","year":"1923","journal-title":"Math. Z."},{"issue":"2","key":"2026032712272909600_ref070","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1561\/1300000013","article-title":"Network coding applications","volume":"2","author":"Fragouli","year":"2007","journal-title":"Found. Trends Netw."},{"issue":"1","key":"2026032712272909600_ref071","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/1300000003","article-title":"Network coding fundamentals","volume":"2","author":"Fragouli","year":"2007","journal-title":"Found. Trends Netw."},{"key":"2026032712272909600_ref072","volume-title":"Submodular Functions and Optimization. Second","author":"Fujishige","year":"2005"},{"issue":"10","key":"2026032712272909600_ref073","doi-asserted-by":"crossref","first-page":"6703","DOI":"10.1109\/TIT.2011.2155618","article-title":"Graph-theoretical constructions for graph entropy and network coding based communications","volume":"57","author":"Gadouleau","year":"2011","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref074","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1017\/S0004972700007760","article-title":"A new graph product and its spectrum","volume":"18","author":"Godsil","year":"1978","journal-title":"Bull. Austral. Math. Soc."},{"key":"2026032712272909600_ref075","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2018.2810384","article-title":"The minrank of random graphs","volume":"64","author":"Golovnev","year":"2018","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref076","first-page":"267","article-title":"An upper bound for the Shannon capacity of a graph","volume":"25","author":"Haemers","year":"1978","journal-title":"Colloq. Math. Soc. Janos Bolyai."},{"issue":"2","key":"2026032712272909600_ref077","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1109\/TIT.1979.1056027","article-title":"On some problems of Lov\u00e1sz concerning the Shannon capacity of a graph","volume":"25","author":"Haemers","year":"1979","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref078","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs. Second","author":"Hammack","year":"2011"},{"key":"2026032712272909600_ref079","first-page":"2231","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Haviv","year":"2012"},{"key":"2026032712272909600_ref080","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511754623","volume-title":"Network Coding: An Introduction","author":"Ho","year":"2008"},{"issue":"4","key":"2026032712272909600_ref081","doi-asserted-by":"crossref","first-page":"2098","DOI":"10.1109\/TIT.2017.2655034","article-title":"Lattice index codes from algebraic number fields","volume":"63","author":"Huang","year":"2017","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref082","first-page":"14","volume-title":"Proc. IEEE Inf. Theory Workshop","author":"Huang","year":"2015"},{"issue":"1","key":"2026032712272909600_ref083","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1109\/TIT.2013.2285151","article-title":"Topological interference management through index coding","volume":"60","author":"Jafar","year":"2014","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"2","key":"2026032712272909600_ref084","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1109\/TIT.2015.2504556","article-title":"Fundamental limits of caching in wireless D2D networks","volume":"62","author":"Ji","year":"2016","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"4","key":"2026032712272909600_ref085","doi-asserted-by":"crossref","first-page":"2076","DOI":"10.1109\/TIT.2016.2643680","article-title":"Blind index coding","volume":"63","author":"Kao","year":"2017","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref086","first-page":"2543","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Karmoose","year":"2017"},{"issue":"12","key":"2026032712272909600_ref087","doi-asserted-by":"crossref","first-page":"7687","DOI":"10.1109\/TIT.2017.2756663","article-title":"Index coding with erroneous side information","volume":"63","author":"Kim","year":"2017","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"6","key":"2026032712272909600_ref088","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1109\/18.720537","article-title":"Zero-error information theory","volume":"44","author":"K\u00f6rner","year":"1998","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"1","key":"2026032712272909600_ref089","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.jctb.2005.03.006","article-title":"Local chromatic number and Sperner capacity","volume":"95","author":"K\u00f6rner","year":"2005","journal-title":"J. Combin. Theory Ser. B."},{"key":"2026032712272909600_ref090","volume-title":"Directed Information for Channels with Feedback","author":"Kramer","year":"1998"},{"key":"2026032712272909600_ref091","first-page":"313","volume-title":"Proc. IEEE Inf. Theory Workshop","author":"Kramer","year":"2007"},{"key":"2026032712272909600_ref092","first-page":"1478","volume-title":"Proc. 49th Ann. Allerton Conf. Comm. Control Comput","author":"Langberg","year":"2011"},{"issue":"2","key":"2026032712272909600_ref093","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1109\/TIT.2010.2094910","article-title":"On the hardness of approximating the network coding capacity","volume":"57","author":"Langberg","year":"2011","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"3","key":"2026032712272909600_ref094","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/LCOMM.2015.2388477","article-title":"Index coding with coded side-information","volume":"19","author":"Lee","year":"2015","journal-title":"IEEE Comm. Lett."},{"key":"2026032712272909600_ref095","first-page":"3060","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Li","year":"2017"},{"issue":"1","key":"2026032712272909600_ref096","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TIT.2017.2756959","article-title":"A fundamental tradeoff between computation and communication in distributed computing","volume":"64","author":"Li","year":"2018","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref097","first-page":"3065","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Liu","year":"2017"},{"key":"2026032712272909600_ref098","unstructured":"Liu, Y., P.Sadeghi, F.Arbabjolfaei, and Y.-H.Kim (2018a). \u201cCapacity theorems for distributed index coding\u201d. url: http:\/\/arxiv.org\/abs\/1801.09063."},{"key":"2026032712272909600_ref099","first-page":"456","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Liu","year":"2018"},{"key":"2026032712272909600_ref100","volume-title":"Proc. IEEE Inf. Theory Workshop","author":"Liu","year":"2018"},{"key":"2026032712272909600_ref101","volume-title":"Proc. IEEE Inf. Theory Workshop","author":"Liu","year":"2018"},{"issue":"3","key":"2026032712272909600_ref102","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Math"},{"issue":"1","key":"2026032712272909600_ref103","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","article-title":"On the Shannon capacity of a graph","volume":"25","author":"Lov\u00e1sz","year":"1979","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"8","key":"2026032712272909600_ref104","doi-asserted-by":"crossref","first-page":"3544","DOI":"10.1109\/TIT.2009.2023702","article-title":"Nonlinear index coding outperforming the linear optimum","volume":"55","author":"Lubetzky","year":"2009","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"8","key":"2026032712272909600_ref105","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1109\/TIT.2008.926460","article-title":"Communication over MIMO X channels: Interference alignment, decomposition, and performance analysis","volume":"54","author":"Maddah-Ali","year":"2008","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"5","key":"2026032712272909600_ref106","doi-asserted-by":"crossref","first-page":"2856","DOI":"10.1109\/TIT.2014.2306938","article-title":"Fundamental limits of caching","volume":"60","author":"Maddah-Ali","year":"2014","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"9","key":"2026032712272909600_ref107","doi-asserted-by":"crossref","first-page":"5402","DOI":"10.1109\/TIT.2014.2338865","article-title":"Index coding: An interference alignment perspective","volume":"60","author":"Maleki","year":"2014","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"3","key":"2026032712272909600_ref108","doi-asserted-by":"crossref","first-page":"306311","DOI":"10.1109\/TIT.1979.1056046","article-title":"A coding theorem for the discrete memoryless broadcast channel","volume":"25","author":"Marton","year":"1979","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"2","key":"2026032712272909600_ref109","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/jgt.3190090208","article-title":"Longest paths and cycles in K1,3-free graphs","volume":"9","author":"Matthews","year":"1985","journal-title":"J. Graph Theory"},{"key":"2026032712272909600_ref110","first-page":"41","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Mat\u00fa\u0161","year":"2007"},{"issue":"11","key":"2026032712272909600_ref111","doi-asserted-by":"crossref","first-page":"5810","DOI":"10.1109\/TIT.2015.2472521","article-title":"Storage capacity of repairable networks","volume":"61","author":"Mazumdar","year":"2015","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref112","doi-asserted-by":"crossref","unstructured":"Mazumdar, A., A.McGregor, and S.Vorotnikova (2017). \u201cStorage capacity as an information-theoretic analogue of vertex cover\u201d. URL: http:\/\/arxiv.org\/abs\/1706.09197.","DOI":"10.1109\/ISIT.2017.8007042"},{"issue":"11","key":"2026032712272909600_ref113","doi-asserted-by":"crossref","first-page":"7382","DOI":"10.1109\/TIT.2017.2743688","article-title":"Perfectly secure index coding","volume":"63","author":"Mojahedian","year":"2017","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref114","doi-asserted-by":"crossref","unstructured":"Narayanan, V., V. M.Prabhakaran, J.Ravi, V. K.Mishra, B. K.Dey, and N.Karamchandani (2018). \u201cPrivate index coding\u201d. In: Proc. IEEE Int. Symp. Inf. Theory. Vail, CO. 596\u2013600.","DOI":"10.1109\/ISIT.2018.8437353"},{"issue":"8","key":"2026032712272909600_ref115","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1109\/LCOMM.2015.2439268","article-title":"Index codes for the Gaussian broadcast channel using quadrature amplitude modulation","volume":"19","author":"Natarajan","year":"2015","journal-title":"IEEE Comm. Lett."},{"issue":"12","key":"2026032712272909600_ref116","doi-asserted-by":"crossref","first-page":"6505","DOI":"10.1109\/TIT.2015.2491924","article-title":"Lattice index coding","volume":"61","author":"Natarajan","year":"2015","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"11","key":"2026032712272909600_ref117","doi-asserted-by":"crossref","first-page":"7525","DOI":"10.1109\/TIT.2013.2279876","article-title":"Dynamic index coding for wireless broadcast networks","volume":"59","author":"Neely","year":"2013","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"11","key":"2026032712272909600_ref118","doi-asserted-by":"crossref","first-page":"7116","DOI":"10.1109\/TIT.2017.2748562","article-title":"Optimal finite-length and asymptotic index codes for five or fewer receivers","volume":"63","author":"Ong","year":"2017","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"6","key":"2026032712272909600_ref119","doi-asserted-by":"crossref","first-page":"3165","DOI":"10.1109\/TIT.2016.2555950","article-title":"The single uniprior index coding problem: The single sender case and the multi sender extension","volume":"62","author":"Ong","year":"2016","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref120","first-page":"841","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Ong","year":"2018"},{"key":"2026032712272909600_ref121","first-page":"2834","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Ong","year":"2016"},{"key":"2026032712272909600_ref122","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/038","volume-title":"Theory of Graphs","author":"Ore","year":"1962"},{"issue":"5","key":"2026032712272909600_ref123","doi-asserted-by":"crossref","first-page":"3021","DOI":"10.1109\/TIT.2013.2241819","article-title":"Repair optimal erasure codes through Hadamard designs","volume":"59","author":"Papailiopoulos","year":"2013","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"3","key":"2026032712272909600_ref124","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/BF01261326","article-title":"Orthogonal representations over finite fields and the chromatic number of graphs","volume":"16","author":"Peeters","year":"1996","journal-title":"Combinatorica"},{"issue":"R44","key":"2026032712272909600_ref125","first-page":"1","article-title":"Information flows, graphs and their guessing numbers","volume":"14","author":"Riis","year":"2007","journal-title":"Elec. J. Comb."},{"issue":"4","key":"2026032712272909600_ref126","doi-asserted-by":"crossref","first-page":"515","DOI":"10.4153\/CJM-1957-060-7","article-title":"Graphs with given group and given graphtheoretical properties","volume":"9","author":"Sabidussi","year":"1957","journal-title":"Canad. J. Math."},{"key":"2026032712272909600_ref127","first-page":"330","volume-title":"Proc. IEEE Inf. Theory Workshop","author":"Sadeghi","year":"2016"},{"key":"2026032712272909600_ref128","volume-title":"Fractional Graph Theory: A Rational Approach to the Theory of Graphs","author":"Scheinerman","year":"2011"},{"key":"2026032712272909600_ref129","volume-title":"Combinatorial Optimization. 3 vols","author":"Schrijver","year":"2003"},{"key":"2026032712272909600_ref130","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BFb0066438","volume-title":"Graphs and Combinatorics","author":"Schwenk","year":"1974"},{"issue":"3","key":"2026032712272909600_ref131","doi-asserted-by":"crossref","first-page":"1837","DOI":"10.1109\/TIT.2011.2173792","article-title":"Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff","volume":"58","author":"Shah","year":"2012","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref132","first-page":"296","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Shanmugam","year":"2014"},{"key":"2026032712272909600_ref133","first-page":"1152","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Shanmugam","year":"2013"},{"key":"2026032712272909600_ref134","first-page":"291","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Shanmugam","year":"2014"},{"key":"2026032712272909600_ref135","first-page":"381","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Shanmugam","year":"2015"},{"issue":"4","key":"2026032712272909600_ref136","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"2026032712272909600_ref137","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"2026032712272909600_ref138","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","article-title":"The zero error capacity of a noisy channel","volume":"2","author":"Shannon","year":"1956","journal-title":"IRE Trans. Inf. Theory."},{"issue":"4","key":"2026032712272909600_ref139","first-page":"142","article-title":"Coding theorems for a discrete source with a fidelity criterion","volume":"7","author":"Shannon","year":"1959","journal-title":"IRE Int. Conv. Rec. Vol."},{"issue":"2","key":"2026032712272909600_ref140","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TIT.2010.2090212","article-title":"Universal secure network coding via rank-metric codes","volume":"57","author":"Silva","year":"2011","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref141","first-page":"81","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Sima","year":"2014"},{"issue":"2","key":"2026032712272909600_ref142","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1109\/TIT.2017.2752088","article-title":"A polynomial-time algorithm for pliable index coding","volume":"64","author":"Song","year":"2018","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"9","key":"2026032712272909600_ref143","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1080\/00029890.1959.11989405","article-title":"The voting problem","volume":"66","author":"Stearns","year":"1959","journal-title":"Amer. Math. Monthly."},{"issue":"2","key":"2026032712272909600_ref144","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1006\/jctb.1993.1070","article-title":"Planar Ramsey numbers","volume":"59","author":"Steinberg","year":"1993","journal-title":"J. Combin. Theory Ser. B."},{"issue":"6","key":"2026032712272909600_ref145","doi-asserted-by":"crossref","first-page":"3041","DOI":"10.1109\/TIT.2015.2418289","article-title":"Index coding capacity: How far can one go with only Shannon inequalities?","volume":"61","author":"Sun","year":"2015","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"7","key":"2026032712272909600_ref146","doi-asserted-by":"crossref","first-page":"4075","DOI":"10.1109\/TIT.2017.2689028","article-title":"The capacity of private information retrieval","volume":"63","author":"Sun","year":"2017","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"2","key":"2026032712272909600_ref147","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/JSAC.2014.2384294","article-title":"Critical graphs in index coding","volume":"33","author":"Tahmasbi","year":"2015","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"4","key":"2026032712272909600_ref148","doi-asserted-by":"crossref","first-page":"1850","DOI":"10.1109\/TIT.2016.2529643","article-title":"Cut-set bounds on network information flow","volume":"62","author":"Thakor","year":"2016","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref149","first-page":"1","volume-title":"Proc. IEEE Global Telecommun. Conf","author":"Thapa","year":"2016"},{"issue":"6","key":"2026032712272909600_ref150","doi-asserted-by":"crossref","first-page":"3692","DOI":"10.1109\/TIT.2017.2662706","article-title":"Interlinked cycles for index coding: Generalizing cycles and cliques","volume":"63","author":"Thapa","year":"2017","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref151","unstructured":"\u201cThe On-Line Encyclopedia of Integer Sequences\u201d (n.d.). URL: http:\/\/oeis.org\/A000273."},{"key":"2026032712272909600_ref152","first-page":"436","article-title":"Eine extremalaufgabe aus der graphentheorie","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok."},{"issue":"11","key":"2026032712272909600_ref153","doi-asserted-by":"crossref","first-page":"6359","DOI":"10.1109\/TIT.2016.2608943","article-title":"A rate-distortion approach to index coding","volume":"62","author":"Unal","year":"2016","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref154","first-page":"61","volume-title":"Proc. IEEE Inf. Theory Workshop","author":"Urbanke","year":"1998"},{"key":"2026032712272909600_ref155","volume-title":"Introduction to Graph Theory","author":"West","year":"2001"},{"issue":"4","key":"2026032712272909600_ref156","first-page":"339","article-title":"The maximal-error and average-error capacity region of the broadcast channel are identical: A direct proof","volume":"19","author":"Willems","year":"1990","journal-title":"Probl. Control Inf. Theory."},{"key":"2026032712272909600_ref157","first-page":"3","volume-title":"Proc. IEEE\/CAM Inf. Theory Workshop","author":"Willems","year":"1989"},{"issue":"5","key":"2026032712272909600_ref158","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TIT.1976.1055607","article-title":"The zero-error side information problem and chromatic numbers","volume":"22","author":"Witsenhausen","year":"1976","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"1","key":"2026032712272909600_ref159","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF00281397","article-title":"Simultaneous channels","volume":"4","author":"Wolfowitz","year":"1960","journal-title":"Arch. Rational Mech. Anal."},{"key":"2026032712272909600_ref160","first-page":"1141","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Wu","year":"2007"},{"issue":"6","key":"2026032712272909600_ref161","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1109\/TIT.2002.1003820","article-title":"Communicating via a processing broadcast satellite","volume":"48","author":"Wyner","year":"2002","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref162","first-page":"108","volume-title":"Proc. IEEE Inf. Theory Workshop","author":"Xue","year":"2007"},{"issue":"2","key":"2026032712272909600_ref163","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1109\/18.370142","article-title":"Multilevel diversity coding with distortion","volume":"41","author":"Yeung","year":"1995","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref164","volume-title":"Information Theory and Network Coding","author":"Yeung","year":"2008"},{"issue":"4","key":"2026032712272909600_ref165","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1109\/18.761254","article-title":"Distributed source coding for satellite communications","volume":"45","author":"Yeung","year":"1999","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref166","author":"Yi","year":"2018"},{"issue":"3","key":"2026032712272909600_ref167","doi-asserted-by":"crossref","first-page":"2065","DOI":"10.1109\/TIT.2018.2795019","article-title":"TDMA is optimal for all-unicast DoF region of TIM if and only if topology is chordal bipartite","volume":"64","author":"Yi","year":"2018","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712272909600_ref168","first-page":"2472","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Yoo","year":"2009"},{"issue":"11","key":"2026032712272909600_ref169","doi-asserted-by":"crossref","first-page":"7256","DOI":"10.1109\/TIT.2014.2354044","article-title":"Duality codes and the integrality gap bound for index coding","volume":"60","author":"Yu","year":"2014","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"4","key":"2026032712272909600_ref170","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1109\/18.681320","article-title":"On characterization of entropy function via information inequalities","volume":"44","author":"Zhang","year":"1998","journal-title":"IEEE Trans. Inf. Theory."}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/14\/3-4\/163\/11146818\/0100000094en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/14\/3-4\/163\/11146818\/0100000094en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:33Z","timestamp":1777471833000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/14\/3-4\/163\/1332138\/Fundamentals-of-Index-Coding"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,17]]},"references-count":170,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2018,10,17]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000094","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,17]]}}}