{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:13:39Z","timestamp":1787501619362,"version":"build-2736575974"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6874841","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T17:50:30Z","timestamp":1408470630000},"page":"291-295","source":"Crossref","is-referenced-by-count":29,"title":["Graph theory versus minimum rank for index coding"],"prefix":"10.1109","author":[{"given":"Karthikeyan","family":"Shanmugam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandros G.","family":"Dimakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"19","volume":"60","author":"lovasz","year":"2012","journal-title":"Large Networks and Graph Limits"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023702"},{"key":"18","author":"simonyi","year":"2013","journal-title":"Relations between the Local Chromatic Number and its Directed Version"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283853"},{"key":"14","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 J Bolyai"},{"key":"11","author":"tahmasbi","year":"2013","journal-title":"Critical Graphs in Index Coding"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620407"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.41"},{"key":"20","year":"0"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2285151"},{"key":"7","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":"Information Theory IEEE Transactions on"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620404"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620369"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264472"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283851"},{"key":"8","author":"effros","year":"2012","journal-title":"An Equivalence between Network Coding and Index Coding"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","location":"Honolulu, HI, USA","start":{"date-parts":[[2014,6,29]]},"end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06874841.pdf?arnumber=6874841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T11:24:20Z","timestamp":1602674660000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6874841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6874841","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}