English

Improved Hotplug Caching Schemes Using PDAs and t-Designs

Information Theory 2024-02-23 v3 Discrete Mathematics math.IT

Abstract

We consider a coded caching system in which some users are offline at the time of delivery. Such systems are called hotplug coded caching systems. A placement delivery array (PDA) is a well-known tool for constructing a coded caching scheme for dedicated caches. In this paper, we introduce the concept of PDAs for hotplug coded caching schemes and refer to it as a hotplug placement delivery array (HpPDA). We give an algorithm to describe the placement and the delivery phase of a hotplug coded caching scheme using HpPDA. We show that an existing hotplug coded caching scheme given by Y. Ma and D. Tuninetti in 2022 corresponds to a class of HpPDAs and then propose a method to further improve the rate of that scheme. Additionally, we construct a class of HpPDAs using tt-designs, which corresponds to a scheme for hotplug coded caching systems. We further improve the rate of this scheme and prove that the cut-set bound is achieved in some higher memory range for a hotplug coded caching system with three active users.

Keywords

Cite

@article{arxiv.2311.02856,
  title  = {Improved Hotplug Caching Schemes Using PDAs and t-Designs},
  author = {Charul Rajput and B. Sundar Rajan},
  journal= {arXiv preprint arXiv:2311.02856},
  year   = {2024}
}

Comments

Two new sections (Sections VIII and IX) have been added. 20 pages, 12 figures and 3 tables

R2 v1 2026-06-28T13:12:18.580Z