{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:48:47Z","timestamp":1763412527340,"version":"3.45.0"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62061004"],"award-info":[{"award-number":["62061004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangxi Higher Institutions Program of Introducing 100 High-Level Overseas Talents, Research Fund of the Guangxi Key Lab of Multi-Source Information Mining & Security","award":["16-B-01"],"award-info":[{"award-number":["16-B-01"]}]},{"name":"Guangxi Scientific Research Project of the Higher Education Department","award":["RZ2000000777"],"award-info":[{"award-number":["RZ2000000777"]}]},{"name":"Guangxi Collaborative Innovation Center of Multi-Source Information Integration and Intelligent Processing"},{"name":"Guangxi Bagui Scholar Teams for Innovation and Research Project"},{"name":"Guangxi Talent Highland Project of Big Data Intelligence and Application"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3042849","type":"journal-article","created":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T19:07:39Z","timestamp":1607368059000},"page":"217456-217462","source":"Crossref","is-referenced-by-count":9,"title":["Improving Placement Delivery Array Coded Caching Schemes With Coded Placement"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9981-7923","authenticated-orcid":false,"given":"Zhang","family":"Mingming","sequence":"first","affiliation":[{"name":"Guangxi Key Lab of Multi-Source Information Mining & Security, Guangxi Normal University, Guilin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0360-0610","authenticated-orcid":false,"given":"Cheng","family":"Minquan","sequence":"additional","affiliation":[{"name":"Guangxi Key Lab of Multi-Source Information Mining & Security, Guangxi Normal University, Guilin, China"}]},{"given":"Wang","family":"Jinyu","sequence":"additional","affiliation":[{"name":"Guangxi Key Lab of Multi-Source Information Mining & Security, Guangxi Normal University, Guilin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7029-2024","authenticated-orcid":false,"given":"Zhong","family":"Xi","sequence":"additional","affiliation":[{"name":"Guangxi Key Lab of Multi-Source Information Mining & Security, Guangxi Normal University, Guilin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9491-4609","authenticated-orcid":false,"given":"Yishan","family":"Chen","sequence":"additional","affiliation":[{"name":"Business College, Guilin Tourism University, Guilin, China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849338"},{"key":"ref11","article-title":"Subexponential and linear subpacketization coded caching via line graphs and projective geometry","author":"chittoor","year":"2020","journal-title":"arXiv 2001 00399"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2847679"},{"key":"ref13","first-page":"1237","article-title":"Coded caching with linear subpacketization is possible using Ruzsa-Szem&#x00E9;redi graphs","author":"shanmugam","year":"2017","journal-title":"Proc IEEE ISIT"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800059"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2599110"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613527"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2962028"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58575-3","author":"van lint","year":"1999","journal-title":"Introduction to Coding Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3005712"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2557804"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504556"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2375553"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2901686"},{"key":"ref7","first-page":"631","article-title":"A unified Ruzsa-Szemer&#x00E9;di framework for finite-length coded caching","author":"shanmugam","year":"2017","journal-title":"Proc 51st ACSSC"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437462"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2765629"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199703)23:3<267::AID-JGT8>3.0.CO;2-N"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09284439.pdf?arnumber=9284439","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T18:42:20Z","timestamp":1763404940000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9284439\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3042849","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}