Caching and Delivery via Interference Elimination Conference Paper

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)

authors

• Tian, Chao

published proceedings

• 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY

author list (cited authors)

• Tian, C., & Chen, J.

citation count

• 35

complete list of authors

• Tian, Chao||Chen, Jun

publication date

• July 2016

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Symposium on Information Theory - Proceedings  Journal

Digital Object Identifier (DOI)

• 10.1109/isit.2016.7541415

International Standard Book Number (ISBN) 13

• 9781509018062

start page

• 830

end page

• 834

volume

• 2016-August

URL

• http://dx.doi.org/10.1109/isit.2016.7541415