{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:53Z","timestamp":1773377633890,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849406","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1217-1221","source":"Crossref","is-referenced-by-count":20,"title":["An Optimal Linear Error Correcting Delivery Scheme for Coded Caching with Shared Caches"],"prefix":"10.1109","author":[{"given":"Nujoom Sageer","family":"Karat","sequence":"first","affiliation":[{"name":"Department of Electrical Communication Engineering, Indian Institute of Science, Bengaluru, KA, 560012, India"}]},{"given":"Spandan","family":"Dey","sequence":"additional","affiliation":[{"name":"School of Electrical Sciences, Indian Institute of Technology, Bhubaneswar, OD, 752050, India"}]},{"given":"Anoop","family":"Thomas","sequence":"additional","affiliation":[{"name":"School of Electrical Sciences, Indian Institute of Technology, Bhubaneswar, OD, 752050, India"}]},{"given":"B. Sundar","family":"Rajan","sequence":"additional","affiliation":[{"name":"Department of Electrical Communication Engineering, Indian Institute of Science, Bengaluru, KA, 560012, India"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Fundamental Limits of Caching in Heterogeneous Networks with Uncoded Prefetching","author":"parrinello","year":"2018","journal-title":"arXiv 1811 06247 [cs IT]"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437469"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437649"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2835507"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227674"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.41"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01261326"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2295331"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2394482"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2639522"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2015.1205"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006802"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2794543"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2834364"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317316"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437310"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2017.7925745"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2017.8292448"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2017.7925744"},{"key":"ref24","article-title":"Bounds on the minimum distance of linear codes and quantum codes","author":"grassl","year":"2007"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2878566"},{"key":"ref25","article-title":"An Optimal Linear Error Correcting Delivery Scheme for Coded Caching with Shard Caches","author":"karat","year":"2019","journal-title":"arXiv 1811 06247 [cs IT]"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849406.pdf?arnumber=8849406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:41Z","timestamp":1773347681000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849406\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849406","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}