{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:15:11Z","timestamp":1767705311934,"version":"3.37.3"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,17]]},"DOI":"10.1109\/itw48936.2021.9611497","type":"proceedings-article","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T21:46:27Z","timestamp":1637703987000},"page":"1-6","source":"Crossref","is-referenced-by-count":4,"title":["Decentralized Multi-access Coded Caching with Uncoded Prefetching"],"prefix":"10.1109","author":[{"given":"Pruthvi","family":"Trinadh","sequence":"first","affiliation":[]},{"given":"Monolina","family":"Dutta","sequence":"additional","affiliation":[]},{"given":"Anoop","family":"Thomas","sequence":"additional","affiliation":[]},{"given":"B. Sundar","family":"Rajan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3052237"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174115"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849406"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282743"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2375553"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2557804"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2394482"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504556"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2639522"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2017.7925535"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262770"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2955384"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2834364"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227674"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2015.1205"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541415"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2638841"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2916556"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317316"},{"key":"ref7","first-page":"2624","article-title":"Fundamental limits of coded caching: The memory rate pair (K-1-1\/K, 1\/(K-1))","author":"kp","year":"2019","journal-title":"Proc 2019 IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2785237"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2281606"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2980817"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664817"},{"key":"ref21","first-page":"1","article-title":"On the exact rate-memory tradeoff for multi-access coded caching with uncoded placement","author":"reddy","year":"2018","journal-title":"Proc 2018 Int Conf Signal Process Commun (SPCOM)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989128"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517891"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518223"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3053048"}],"event":{"name":"2021 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2021,10,17]]},"location":"Kanazawa, Japan","end":{"date-parts":[[2021,10,21]]}},"container-title":["2021 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9611366\/9611357\/09611497.pdf?arnumber=9611497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:52:04Z","timestamp":1652201524000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9611497\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/itw48936.2021.9611497","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]}}}