{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:07Z","timestamp":1773376627057,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206602","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"418-423","source":"Crossref","is-referenced-by-count":4,"title":["Multi-access Coded Caching with Linear Subpacketization"],"prefix":"10.1109","author":[{"given":"Kota Srinivas","family":"Reddy","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Madras"}]},{"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Bombay"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800059"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3216641"},{"key":"ref15","article-title":"Coded caching schemes with low rate and subpacketizations","author":"cheng","year":"2017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM38437.2019.9013280"},{"key":"ref11","first-page":"1237","article-title":"Coded caching with linear subpacketization is possible using ruzsa-szeméredi graphs","author":"shanmugam","year":"2017","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3095471"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206602"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3256417"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3116229"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.662940"},{"key":"ref24","first-page":"962","article-title":"On? the capacity region for index coding","author":"arbabjolfaei","year":"2013","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"key":"ref23","article-title":"Local partial clique covers for index coding","author":"agarwal","year":"2016"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2338865"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2285151"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3126663"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620407"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317316"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517865"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844939"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989128"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3104035"},{"key":"ref4","first-page":"161","article-title":"On the optimality of uncoded cache placement","author":"wan","year":"2016","journal-title":"IEEE Information Theory Workshop (ITW)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664817"},{"key":"ref6","article-title":"An improved multi-access coded caching with uncoded placement","author":"sasi","year":"2020"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2980817"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206602.pdf?arnumber=10206602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:04Z","timestamp":1773347224000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206602\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206602","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}