Some new bounds of placement delivery arrays

TL;DR

This paper establishes new lower bounds for placement delivery arrays (PDAs) used in coded caching schemes and provides constructions for optimal PDAs to improve network efficiency.

Contribution

It introduces novel lower bounds for PDAs and offers new constructions for optimal PDAs, advancing the design of coded caching schemes.

Findings

Proved lower bounds of PDA on elements and columns

Provided constructions for optimal PDA

Enhanced efficiency of coded caching schemes

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.