Some new bounds of placement delivery arrays
arXiv:1703.08900
Abstract
Coded caching scheme is a technique which reduce the load during peak traffic times in a wireless network system. Placement delivery array (PDA in short) was first introduced by Yan et al.. It can be used to design coded caching scheme. In this paper, we prove some lower bounds of PDA on the element and some lower bounds of PDA on the column. We also give some constructions for optimal PDA.
arXiv commentCoded caching scheme, placement delivery array, optimal
References in corpus (7)
- Placement Delivery Array Design through Strong Edge Coloring of Bipartite Graphs
- A Note on the Fundamental Limits of Coded Caching
- Coded Caching Schemes with Low Rate and Subpacketizations
- A New Converse Bound for Coded Caching
- Centralized coded caching schemes: A hypergraph theoretical approach
- The Optimal Placement Delivery Arrays
- New results for traitor tracing schemes