{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:40Z","timestamp":1773377920238,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834838","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1707-1712","source":"Crossref","is-referenced-by-count":10,"title":["Coded Caching for Two-Dimensional Multi-Access Networks"],"prefix":"10.1109","author":[{"given":"Mingming","family":"Zhang","sequence":"first","affiliation":[{"name":"Guangxi Normal University,Guilin,China,541004"}]},{"given":"Kai","family":"Wan","sequence":"additional","affiliation":[{"name":"Technische Universit&#x00E4;t Berlin,Berlin,Germany,10587"}]},{"given":"Minquan","family":"Cheng","sequence":"additional","affiliation":[{"name":"Guangxi Normal University,Guilin,China,541004"}]},{"given":"Giuseppe","family":"Caire","sequence":"additional","affiliation":[{"name":"Technische Universit&#x00E4;t Berlin,Berlin,Germany,10587"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2847679"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3104035"},{"key":"ref12","first-page":"1","article-title":"Multi-access coded caching scheme with linear sub-packetization using PDAs","author":"sasi","year":"2021","journal-title":"IEEE Transactions on Communications"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC50174.2021.9569690"},{"key":"ref14","article-title":"A secretive coded caching for shared cache systems using PDAs","author":"peter","year":"2021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664817"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989128"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2980817"},{"key":"ref18","article-title":"An improved multi-access coded caching with uncoded placement","author":"sasi","year":"2020","journal-title":"ArXiv e-prints"},{"key":"ref19","article-title":"Structured index coding problem and multi-access coded caching","author":"reddy","year":"2020","journal-title":"CoRR"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1979.tb02209.x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2896960"},{"key":"ref27","article-title":"Fundamental limits of combinatorial multi-access caching","author":"brunero","year":"2021"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2901686"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834838"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2962028"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.2981071"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3005425"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2967753"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2765629"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref20","article-title":"Multiaccess coded caching with private demands","author":"liang","year":"2021"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611506"},{"key":"ref21","article-title":"Multi-access coded caching with demand privacy","author":"namboodiri","year":"2021"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3053048"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2981454"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611394"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611437"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834838.pdf?arnumber=9834838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:34Z","timestamp":1773347734000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834838\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834838","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}