{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:10:34Z","timestamp":1760137834442,"version":"build-2065373602"},"reference-count":20,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2022,4,11]],"date-time":"2022-04-11T00:00:00Z","timestamp":1649635200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.62061004, 62076214"],"award-info":[{"award-number":["No.62061004, 62076214"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangxi Bagui Scholar Teams for Innovation and Research Project","award":["2021JJB110029"],"award-info":[{"award-number":["2021JJB110029"]}]},{"DOI":"10.13039\/501100004607","name":"Guangxi Natural Science Foundation","doi-asserted-by":"publisher","award":["2021JJD170057"],"award-info":[{"award-number":["2021JJD170057"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangxi Talent Highland Project of Big Data Intelligence and Application","award":["2021JJD170045"],"award-info":[{"award-number":["2021JJD170045"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>In a traditional (H,r) combination network, each user connects to a unique set of r relays. However, few research efforts have considered the (H,r,u) multiaccess combination network problem wherein each unique set of r relays is connected by u users. In this paper, we focus on designing coded caching schemes for a (H,r,u) multiaccess combination network. By directly applying the well-known coding method (proposed by Zewail and Yener) for a (H,r) combination network, a coded caching scheme (called ZY scheme) for (H,r,u) multiaccess combination network is obtained. However, its subpacketization has an exponential order with the number of users which leads to high implementation complexity. In order to reduce subpacketization, a direct construction of a coded caching scheme (called the direct scheme) for (H,r,u) multiaccess combination network is proposed by means of combinational design theory, where the parameter u must be a combinatorial number. For the arbitrary parameter u, the hybrid construction of a coded caching scheme (called the hybrid scheme) for the (H,r,u) multiaccess combination network is proposed based on the direct scheme. Theoretical and numerical analysis shows that the direct scheme and the hybrid scheme have a smaller transmission load for each relay compared with the naive scheme (which is obtained by repeatedly applying the coded caching scheme for a traditional (H,r) combination network by u times) and have much lower subpacketization compared with the ZY scheme.<\/jats:p>","DOI":"10.3390\/info13040191","type":"journal-article","created":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T00:23:11Z","timestamp":1649722991000},"page":"191","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Coded Caching for Combination Networks with Multiaccess"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3223-2960","authenticated-orcid":false,"given":"Leitang","family":"Huang","sequence":"first","affiliation":[{"name":"Guangxi Key Lab of Multi-Source Information Mining and Security, Guangxi Normal University, Guilin 541004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyu","family":"Wang","sequence":"additional","affiliation":[{"name":"Guangxi Key Lab of Multi-Source Information Mining and Security, Guangxi Normal University, Guilin 541004, China"},{"name":"School of Mathematics and Statistics, Guangxi Normal University, Guilin 541004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0360-0610","authenticated-orcid":false,"given":"Minquan","family":"Cheng","sequence":"additional","affiliation":[{"name":"Guangxi Key Lab of Multi-Source Information Mining and Security, Guangxi Normal University, Guilin 541004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingyong","family":"Deng","sequence":"additional","affiliation":[{"name":"Guangxi Key Lab of Multi-Source Information Mining and Security, Guangxi Normal University, Guilin 541004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3423-1539","authenticated-orcid":false,"given":"Bineng","family":"Zhong","sequence":"additional","affiliation":[{"name":"Guangxi Key Lab of Multi-Source Information Mining and Security, Guangxi Normal University, Guilin 541004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,4,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2856","DOI":"10.1109\/TIT.2014.2306938","article-title":"Fundamental Limits of Caching","volume":"60","author":"Niesen","year":"2014","journal-title":"IEEE Trans. Informat. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1109\/TIT.2020.2967753","article-title":"An index coding approach to caching with uncoded cache placement","volume":"66","author":"Wan","year":"2020","journal-title":"IEEE Trans. Informat. Theory"},{"key":"ref_3","first-page":"5821","article-title":"On the placement delivery array design for centralized coded caching scheme","volume":"63","author":"Yan","year":"2017","journal-title":"IEEE Trans. Informat. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Ji, M., Wong, M.F., Tulino, A.M., Llorca, J., Caire, G., Effros, M., and Langberg, M. (July, January 28). On the fundamental limits of caching in combination networks. Proceedings of the 2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Stockholm, Sweden.","DOI":"10.1109\/SPAWC.2015.7227127"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Zewail, A.A., and Yener, A. (2017, January 25\u201330). Coded caching for combination networks with cache-aided relays. Proceedings of the 2017 IEEE ISIT, Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006966"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Wan, K., Ji, M., Piantanida, P., and Tuninetti, D. (2018, January 17\u201322). On the Benefits of Asymmetric Coded Cache Placement in Combination Networks with End-User Caches. Proceedings of the 2018 IEEE ISIT, Vail, CO, USA.","DOI":"10.1109\/ISIT.2018.8437462"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Wan, K., Ji, M., Piantanida, P., and Tuninetti, D. (2018, January 20\u201324). Caching in Combination Networks: Novel Multicast Message Generation and Delivery by Leveraging the Network Topology. Proceedings of the 2018 IEEE International Conference on Communications (ICC), Kansas City, MO, USA.","DOI":"10.1109\/ICC.2018.8422197"},{"key":"ref_8","unstructured":"Wan, K., Ji, M., Piantanida, P., and Tuninetti, D. (2022, March 11). Combination Networks with Caches: Novel Inner and Outer Bounds with Uncoded Cache Placement. Available online: https:\/\/arxiv.org\/abs\/1701.06884v1."},{"key":"ref_9","unstructured":"Wan, K., Tuninetti, D., Piantanida, P., and Ji, M. (2018, January 14\u201316). On Combination Networks with Cache-aided Relays and Users. Proceedings of the WSA 2018: 22nd International ITG Workshop on Smart Antennas, Bochum, Germany."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Wan, K., Tuninetti, D., Ji, M., and Piantanida, P. (2018, January 11\u201316). A Novel Asymmetric Coded Placement in Combination Networks with End-User Caches. Proceedings of the 2018 Information Theory and Applications Workshop (ITA), San Diego, CA, USA.","DOI":"10.1109\/ITA.2018.8503093"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1109\/TWC.2019.2942913","article-title":"Cache-Aided Combination Networks With Interference","volume":"19","author":"Elkordy","year":"2020","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Yan, Q., Wigger, M., and Yang, S. (2018, January 17\u201322). Placement Delivery Array Design for Combination Networks with Edge Caching. Proceedings of the 2018 IEEE ISIT, Vail, CO, USA.","DOI":"10.1109\/ISIT.2018.8437603"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1732","DOI":"10.1109\/TIT.2020.3049074","article-title":"Linear Coded Caching Scheme for Centralized Networks","volume":"67","author":"Cheng","year":"2021","journal-title":"IEEE Trans. Informat. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"7121","DOI":"10.1109\/TIT.2021.3112492","article-title":"A Framework of Constructing Placement Delivery Arrays for Centralized Coded Caching","volume":"67","author":"Cheng","year":"2021","journal-title":"IEEE Trans. Informat. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"5965","DOI":"10.1109\/TCOMM.2020.3005712","article-title":"Improved Constructions of Coded Caching Schemes for Combination Networks","volume":"68","author":"Cheng","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/LCOMM.2017.2765629","article-title":"Placement delivery array design through strong edge coloring of bipartite graphs","volume":"22","author":"Yan","year":"2018","journal-title":"IEEE Commun. Lett."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1002\/(SICI)1097-0118(199703)23:3<267::AID-JGT8>3.0.CO;2-N","article-title":"Strong chromatic index of subset graphs","volume":"24","author":"Quinn","year":"1997","journal-title":"J. Graph Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2118","DOI":"10.1109\/TCOMM.2020.2970941","article-title":"On the Dynamic Centralized Coded Caching Design","volume":"68","author":"Zhang","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_19","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":"ref_20","doi-asserted-by":"crossref","unstructured":"van Lint, J.H. (1999). Introduction to Coding Theory, Springer.","DOI":"10.1007\/978-3-642-58575-3"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/13\/4\/191\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:52:06Z","timestamp":1760136726000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/13\/4\/191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,11]]},"references-count":20,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,4]]}},"alternative-id":["info13040191"],"URL":"https:\/\/doi.org\/10.3390\/info13040191","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2022,4,11]]}}}