Caching and Delivery via Interference Elimination Conference Paper uri icon

abstract

  • 2016 IEEE. We propose a new caching scheme where linear combinations of the file segments are cached at the users, for the scenarios where the number of files is no greater than the number of users. When a user requests a certain file in the delivery phase, the other file segments in the cached linear combinations can be viewed as interferences. The proposed scheme combines rank metric codes and maximum distance separable codes to facilitate the decoding and elimination of these interferences, and also to simultaneously deliver useful contents to the intended users. The performance of the proposed scheme can be explicitly evaluated, and we show that the new scheme can strictly improve existing tradeoff inner bounds in the literature; for certain cases, the new tradeoff points are in fact optimal.

name of conference

  • 2016 IEEE International Symposium on Information Theory (ISIT)

published proceedings

  • 2016 IEEE International Symposium on Information Theory (ISIT)

author list (cited authors)

  • Tian, C., & Chen, J.

citation count

  • 34

complete list of authors

  • Tian, Chao||Chen, Jun

publication date

  • January 1, 2016 11:11 AM