{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:51:05Z","timestamp":1730274665043,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6283852","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T20:57:57Z","timestamp":1346360277000},"page":"2241-2245","source":"Crossref","is-referenced-by-count":6,"title":["Optimal index codes with near-extreme rates"],"prefix":"10.1109","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":[{"journal-title":"Index Coding Via Linear Programming","year":"2011","author":"blasiak","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.48"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.41"},{"journal-title":"On Linear Index Coding for Random Graphs","year":"2011","author":"haviv","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034247"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.4544612"},{"key":"7","first-page":"267","article-title":"An upper bound for the shannon capacity of a graph","volume":"25","author":"haemers","year":"1978","journal-title":"Algebr Methods Graph Theory"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159942"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048502"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01261326"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2012,7,1]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06283852.pdf?arnumber=6283852","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T23:21:10Z","timestamp":1490138470000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6283852\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6283852","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}