Some new bounds of placement delivery arrays

X. Niu; H. Cao

Some new bounds of placement delivery arrays

Information Theory 2017-03-28 v1 math.IT

Authors: X. Niu , H. Cao

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.

Keywords

coded caching placement delivery array PDA lower bounds optimal constructions wireless networks combinatorial design

Cite

@article{arxiv.1703.08900,
  title  = {Some new bounds of placement delivery arrays},
  author = {X. Niu and H. Cao},
  journal= {arXiv preprint arXiv:1703.08900},
  year   = {2017}
}

Comments

Coded caching scheme, placement delivery array, optimal

Related papers

View all related →