pith. sign in

arxiv: 1703.08900 · v1 · pith:AA3ZFRY7new · submitted 2017-03-27 · 💻 cs.IT · math.IT

Some new bounds of placement delivery arrays

classification 💻 cs.IT math.IT
keywords someboundscachingcodeddeliverylowerplacementscheme
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.