{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:56Z","timestamp":1773378176190,"version":"3.50.1"},"reference-count":20,"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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","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.9834597","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1306-1311","source":"Crossref","is-referenced-by-count":3,"title":["Design of Coded Caching Schemes through Proper Orthogonal Arrays"],"prefix":"10.1109","author":[{"given":"Xianzhang","family":"Wu","sequence":"first","affiliation":[{"name":"Guangxi Normal University,Guangxi Key Lab of Multi-Source Information Mining and Security,Guilin,China,541004"}]},{"given":"Minquan","family":"Cheng","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University,School of Electronics and Information Technology,Guangzhou,China,510006"}]},{"given":"Congduan","family":"Li","sequence":"additional","affiliation":[{"name":"Guangxi Normal University,Guangxi Key Lab of Multi-Source Information Mining and Security,Guilin,China,541004"}]},{"given":"Li","family":"Chen","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University,School of Electronics and Information Technology,Guangzhou,China,510006"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2599110"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2765629"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800059"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2962028"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2901686"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3112492"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.2981071"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3005425"},{"key":"ref19","author":"stinson","year":"2003","journal-title":"Combinatorial Designs Construction and Analysis"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849338"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"217456","DOI":"10.1109\/ACCESS.2020.3042849","article-title":"Improving placement delivery array coded caching schemes with coded placement","volume":"8","author":"zhang","year":"2020","journal-title":"IEEE Access"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3095471"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849805"},{"key":"ref8","first-page":"1237","article-title":"Coded caching with linear subpacketization is possible using Ruzsa-Szeméredi graphs","author":"shanmugam","year":"2017","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2847679"},{"key":"ref2","first-page":"161","article-title":"On the optimality of uncoded cache placement","author":"wan","year":"2016","journal-title":"Proc IEEE Inf Theory Workshop (ITW)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref9","first-page":"631","article-title":"A unified Ruzsa-Szemerédi framework for finite-length coded caching","author":"shanmugam","year":"2017","journal-title":"Proc The 51st ACSSC"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1109\/TCOMM.2022.3207838","article-title":"Design of placement delivery arrays for coded caching with small subpacketizations and flexible memory sizes","author":"wu","year":"2022"}],"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\/09834597.pdf?arnumber=9834597","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:38Z","timestamp":1773347798000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834597\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834597","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}