{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:30:11Z","timestamp":1725499811410},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/itw.2017.8278042","type":"proceedings-article","created":{"date-parts":[[2018,2,7]],"date-time":"2018-02-07T15:45:14Z","timestamp":1518018314000},"page":"6-10","source":"Crossref","is-referenced-by-count":0,"title":["Communication-optimal coding designs for caching networks"],"prefix":"10.1109","author":[{"given":"Qian","family":"Yu","sequence":"first","affiliation":[]},{"given":"Mohammad Ali","family":"Maddah-Ali","sequence":"additional","affiliation":[]},{"given":"A. Salman","family":"Avestimehr","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541276"},{"journal-title":"Symmetry outer bounds and code constructions A computer-aided investigation on the fundamental limits of caching","year":"2016","author":"tian","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606816"},{"journal-title":"Information-theoretic caching sequential coding for computing","year":"2015","author":"wang","key":"ref13"},{"journal-title":"A new converse bound for coded caching","year":"2016","author":"wang","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614722"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2015.7227127"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541333"},{"journal-title":"An improved secretive coded caching scheme exploiting common demands","year":"2017","author":"chugh","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007037"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006555"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317316"},{"journal-title":"Information theoretic caching The multi-user case","year":"2016","author":"lim","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282745"},{"key":"ref8","article-title":"Coded caching with nonuniform demands","author":"niesen","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"journal-title":"On the optimality of separation between caching and delivery in general cache networks","year":"2017","author":"naderializadeh","key":"ref7"},{"key":"ref2","article-title":"The exact rate-memory tradeoff for caching with uncoded prefetching","author":"yu","year":"2016","journal-title":"IEEE Trans Inf Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"journal-title":"Coded caching for a large number of users","year":"2016","author":"amiri","key":"ref9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCW.2017.7962819"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2557804"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2394482"}],"event":{"name":"2017 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2017,11,6]]},"location":"Kaohsiung","end":{"date-parts":[[2017,11,10]]}},"container-title":["2017 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8266764\/8277915\/08278042.pdf?arnumber=8278042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T11:54:16Z","timestamp":1521201256000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8278042\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/itw.2017.8278042","relation":{},"subject":[],"published":{"date-parts":[[2017,11]]}}}