{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:50:19Z","timestamp":1774680619637,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000921","name":"ESF COST Action","doi-asserted-by":"publisher","award":["IC1104"],"award-info":[{"award-number":["IC1104"]}],"id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/tit.2017.2687933","type":"journal-article","created":{"date-parts":[[2017,3,27]],"date-time":"2017-03-27T23:56:40Z","timestamp":1490659000000},"page":"3712-3728","source":"Crossref","is-referenced-by-count":13,"title":["Error Correction for Index Coding With Coded Side Information"],"prefix":"10.1109","volume":"63","author":[{"given":"Eimear","family":"Byrne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6817-3421","authenticated-orcid":false,"given":"Marco","family":"Calderini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","first-page":"216","article-title":"Probabilistic algorithms for sparse polynomials","author":"zippel","year":"1979","journal-title":"Proc Int Symp Symbolic Algebr Manipulat"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874841"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048502"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01261326"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283853"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2039167"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2012.6362912"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2014.2330571"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227674"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2188777"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2414926"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2015.1205"},{"key":"ref18","first-page":"161","article-title":"On the optimality of uncoded cache placement","author":"wan","year":"2016","journal-title":"Proc IEEE Inf Theory Workshop (ITW)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1561\/1300000003"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.340483"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.7146\/math.scand.a-12477"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2338865"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/16M107164X"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264472"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282612"},{"key":"ref9","article-title":"Weight distributions of codes from planes","author":"chouinard","year":"1998"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.41"},{"key":"ref20","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inf Transmiss"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITWF.2015.7360725"},{"key":"ref21","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":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(86)90032-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7931776\/07887740.pdf?arnumber=7887740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:15:19Z","timestamp":1642004119000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7887740\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":38,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2687933","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6]]}}}