{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T05:39:04Z","timestamp":1768887544318,"version":"3.49.0"},"reference-count":19,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2025]]},"DOI":"10.3934\/amc.2025021","type":"journal-article","created":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T08:50:57Z","timestamp":1750927857000},"page":"1754-1775","source":"Crossref","is-referenced-by-count":1,"title":["Improved multi-access coded caching schemes from maximal cross resolvable designs"],"prefix":"10.3934","volume":"19","author":[{"given":"Gang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yannan","family":"Li","sequence":"additional","affiliation":[{"name":"College of Science, Civil Aviation University of China, Tianjin, 300300, China"}]},{"given":"You","family":"Gao","sequence":"additional","affiliation":[{"name":"College of Science, Civil Aviation University of China, Tianjin, 300300, China"}]},{"given":"Minyao","family":"Niu","sequence":"additional","affiliation":[{"name":"School of Sciences, Tianjin University of Commerce, Tianjin, 300134, China"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2025021-1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3104035"},{"key":"key-10.3934\/amc.2025021-2","doi-asserted-by":"crossref","unstructured":"<p>N. Das and B. S. Rajan, Multi-access coded caching schemes from maximal cross resolvable designs, <i>IEEE International Symposium on Information Theory (ISIT)<\/i>, Espoo, Finland, (2022), 1719-1724.<\/p>","DOI":"10.1109\/ISIT50566.2022.9834353"},{"key":"key-10.3934\/amc.2025021-3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664817"},{"key":"key-10.3934\/amc.2025021-4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3053048"},{"key":"key-10.3934\/amc.2025021-5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"key-10.3934\/amc.2025021-6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317316"},{"key":"key-10.3934\/amc.2025021-7","doi-asserted-by":"crossref","unstructured":"<p>A. A. Mahesh and B. S. Rajan, A coded caching scheme with linear sub-packetization and its application to multi-access coded caching, <i>IEEE Information Theory Workshop (ITW)<\/i>, Riva del Garda, Italy, (2021), 1-5..<\/p>","DOI":"10.1109\/ITW46852.2021.9457641"},{"key":"key-10.3934\/amc.2025021-8","doi-asserted-by":"crossref","unstructured":"<p>P. N. Muralidhar, D. Katyal and B. S. Rajan, Improved multi-access coded caching schemes from cross resolvable designs, <i>IEEE Information Theory Workshop (ITW)<\/i>, Kanazawa, Japan, (2021), 1-6.<\/p>","DOI":"10.1109\/ITW48936.2021.9611437"},{"key":"key-10.3934\/amc.2025021-9","doi-asserted-by":"crossref","unstructured":"<p>P. N. Muralidhar and B. S. Rajan, Multi-access coded caching from a new class of cross resolvable designs, <i>IEEE International Symposium on Information Theory (ISIT)<\/i>, Melbourne, Australia, (2021), 855-860.<\/p>","DOI":"10.1109\/ISIT45174.2021.9517876"},{"key":"key-10.3934\/amc.2025021-10","doi-asserted-by":"crossref","unstructured":"<p>E. Peter, K. K. K. Namboodiri and B. S. Rajan, Multi-antenna coded caching for multi-access networks with cyclic wrap-around, <i>IEEE Transactions on Communications<\/i>, 2025.<\/p>","DOI":"10.1109\/TCOMM.2025.3534461"},{"key":"key-10.3934\/amc.2025021-11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2980817"},{"key":"key-10.3934\/amc.2025021-12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3126663"},{"key":"key-10.3934\/amc.2025021-13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3116229"},{"key":"key-10.3934\/amc.2025021-14","unstructured":"<p>S. Sasi and B. S. Rajan, An improved multi-access coded caching with uncoded placement, <i>Available on arXiv<\/i>, 2009.05377v3.<\/p>"},{"key":"key-10.3934\/amc.2025021-15","doi-asserted-by":"crossref","unstructured":"<p>B. Serbetci, E. Parrinello and P. Elia, Multi-access coded caching: gains beyond cache-redundancy, <i>IEEE Information Theory Workshop (ITW)<\/i>, Visby, Gotland, (2019), 1-5.<\/p>","DOI":"10.1109\/ITW44776.2019.8989173"},{"key":"key-10.3934\/amc.2025021-16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2599110"},{"key":"key-10.3934\/amc.2025021-17","unstructured":"<p>D. R. Stinson, Combination designs : Constructions analysis, <i>Springer<\/i>, Cham, Switzerland, 2003.<\/p>"},{"key":"key-10.3934\/amc.2025021-18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3256417"},{"key":"key-10.3934\/amc.2025021-19"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T01:35:40Z","timestamp":1750988140000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2025021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2025021","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}