{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:04Z","timestamp":1740169144680,"version":"3.37.3"},"reference-count":28,"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":["11601096","61672176"],"award-info":[{"award-number":["11601096","61672176"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004607","name":"Guangxi Natural Science Foundation","doi-asserted-by":"publisher","award":["2016GXNSFFA380011","2016GXNSFCA380021","2018GXNSFAA138152"],"award-info":[{"award-number":["2016GXNSFFA380011","2016GXNSFCA380021","2018GXNSFAA138152"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangxi Higher Institutions Program of Introducing 100 High-Level Overseas Talents"},{"name":"Research Fund of Guangxi Key Laboratory of Multi-Source Information Mining and Security","award":["16-B-01","18-B-01"],"award-info":[{"award-number":["16-B-01","18-B-01"]}]},{"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.2992091","type":"journal-article","created":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T00:00:54Z","timestamp":1588636854000},"page":"86305-86315","source":"Crossref","is-referenced-by-count":2,"title":["Some New Coded Caching Schemes With Smaller Subpacketization via Some Known Results"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0360-0610","authenticated-orcid":false,"given":"Minquan","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1034-0474","authenticated-orcid":false,"given":"Wenyu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1942-3834","authenticated-orcid":false,"given":"Jing","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"922","article-title":"Order-optimal rate of caching and coded multicasting with random demands","author":"ji","year":"2014","journal-title":"Proc 11th ISWCS"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613527"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.23919\/WIOPT.2018.8362816"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844960"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IWSDA46143.2019.8966098"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2014.6883597"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282744"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2847679"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2599110"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2785237"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2901686"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2765629"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2896960"},{"key":"ref6","article-title":"Subexponential and linear subpacketization coded caching via line graphs and projective geometry","author":"hara suthan chittoor","year":"2020","journal-title":"arXiv 2001 00399"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849805"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2545413"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282745"},{"key":"ref2","article-title":"Coded caching schemes with low rate and subpacketizations","author":"cheng","year":"2017","journal-title":"arXivarXiv 1703 01548"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504556"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2638841"},{"key":"ref20","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":"ref22","article-title":"Some new constructions of coded caching schemes with reduced subpacketization","author":"song","year":"2019","journal-title":"arXiv 1908 06570"},{"key":"ref21","first-page":"631","article-title":"A unified Ruzsa-Szemerédi framework for finite-length coded caching","author":"shanmugam","year":"2017","journal-title":"Proc 51st Asilomar Conf Signals Syst Comput"},{"key":"ref24","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":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541415"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888186"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09085410.pdf?arnumber=9085410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:51:49Z","timestamp":1639770709000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9085410\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2992091","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}