{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:53:59Z","timestamp":1761663239575},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1109\/tit.2013.2295331","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T17:50:19Z","timestamp":1391190619000},"page":"1515-1527","source":"Crossref","is-referenced-by-count":26,"title":["Optimal Index Codes With Near-Extreme Rates"],"prefix":"10.1109","volume":"60","author":[{"given":"Son Hoang","family":"Dau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Skachek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yeow Meng","family":"Chee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/321850.321852"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF02854581"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01844848"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-011-1687-5"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3149.3159"},{"key":"ref30","first-page":"157","article-title":"Directed graphs and computer programs","author":"frank","year":"1976","journal-title":"Problemes Combinatoires et Th\ufffdorie des Graphes"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90080-1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/0403048"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-17.3.369"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref40","author":"lucchesi","year":"1976","journal-title":"A minimax equality for directed graphs"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01261326"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.4544612"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283850"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034247"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.35"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283851"},{"key":"ref18","author":"west","year":"1996","journal-title":"Introduction to Graph Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594999"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048502"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/089\/1006483"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1403004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923722"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"ref9","first-page":"267","volume":"25","author":"haemers","year":"1978","journal-title":"Colloq Math Soc Jnos Bolyai 25 Algebraic Methods in Graph Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2009.5425315"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9789-9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2010.5487684"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.48"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034005"},{"key":"ref26","author":"blasiak","year":"2011","journal-title":"Index Coding Via Linear Programming"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.41"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6739111\/06687264.pdf?arnumber=6687264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:31:39Z","timestamp":1642005099000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6687264\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":40,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2295331","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}