{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:50:18Z","timestamp":1774680618507,"version":"3.50.1"},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"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":[[2009,8]]},"DOI":"10.1109\/tit.2009.2023702","type":"journal-article","created":{"date-parts":[[2009,7,18]],"date-time":"2009-07-18T07:16:44Z","timestamp":1247901404000},"page":"3544-3551","source":"Crossref","is-referenced-by-count":101,"title":["Nonlinear Index Coding Outperforming the Linear Optimum"],"prefix":"10.1109","volume":"55","author":[{"given":"Eyal","family":"Lubetzky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Stav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01263424"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/2324684"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055607"},{"key":"ref8","first-page":"267","article-title":"an upper bound for the shannon capacity of a graph","author":"haemers","year":"1978","journal-title":"Colloq Math Soc Jnos Bolyai 25 Algebraic Methods in Graph Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579457"},{"key":"ref2","first-page":"823","article-title":"the broadcast rate of a graph","author":"alon","year":"2009","journal-title":"Proc Conf Foundations of Computer Science (FOCS)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056027"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009824"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5165162\/05165171.pdf?arnumber=5165171","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:53:49Z","timestamp":1633910029000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5165171\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":12,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2023702","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}