2020/09/22 by Anjana A. Mahesh, Mahesh, Anjana A., B. Sundar Rajan +1
Computer Science · #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks
paper · pdf · doi:10.48550/arxiv.2009.10923
openalex publication_date 2020/09/22 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28
This paper addresses the problem of exponentially increasing\nsub-packetization with the number of users in a centralized coded caching\nsystem by introducing a new coded caching scheme inspired by the symmetric\nneighboring consecutive side information index coding problem. The scheme has a\nplacement policy where the number of sub-packets required grows only linearly\nwith the number of users, with no restriction on file size, and a delivery\npolicy which is instantaneously decodable. Further, an application of the new\ndelivery scheme in a multi-access coded caching set-up is studied and a few\nresults in that direction are presented. In particular, in the multi-access\nset-up, for cases where optimality rate-memory trade-off characterizations are\navailable, it is shown that the new delivery scheme achieves optimal or\nnear-optimal rates.\n