2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | N.3.2 | ||
| Paper Title | An Optimal Linear Error Correcting Scheme for Shared Caching with Small Cache Sizes | ||
| Authors | Sonu Rathi, Anoop Thomas, Monolina Dutta, Indian Institute of Technology Bhubaneswar, India | ||
| Session | N.3: Coded Caching I | ||
| Presentation | Lecture | ||
| Track | Networking and Network Coding | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | Coded caching is a technique which enables the server to reduce the peak traffic rate by making use of the caches available at each user. In the classical coded caching problem, a centralized server is connected to many users through an error free link. Each user have a dedicated cache memory. This paper considers the shared caching problem which is an extension of the coded caching problem in which each cache memory could be shared by more than one user. An existing prefetching and delivery scheme for the shared caching problem with better rate-memory tradeoff than the rest is studied and the optimality of the scheme is proved by using techniques from index coding. The worst case rate of the coded caching problem is also obtained by using cut-set bound techniques. An optimal linear error correcting delivery scheme is obtained for the shared caching problem satisfying certain conditions. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
