Improved converses and gap-results for coded caching

Chien Yi Wang; Shirin Saeedi Bidokhti; Michele Wigger

doi:10.1109/ISIT.2017.8006965

Improved converses and gap-results for coded caching

Chien Yi Wang, Shirin Saeedi Bidokhti, Michele Wigger

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Improved lower bounds on the worst-case and the average-case rate-memory tradeoffs for the Maddah-Ali&Niesen coded-caching scenario are presented. For any number of users and files and for arbitrary cache sizes, the multiplicative gap between the exact rate-memory tradeoff and the new lower bound is less than 2.315 in the worst-case scenario and less than 2.507 in the average-case scenario.

Original language	English
Title of host publication	2017 IEEE International Symposium on Information Theory, ISIT 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2428-2432
Number of pages	5
ISBN (Electronic)	9781509040964
DOIs	https://doi.org/10.1109/ISIT.2017.8006965
Publication status	Published - 9 Aug 2017
Externally published	Yes
Event	2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany Duration: 25 Jun 2017 → 30 Jun 2017

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/Territory	Germany
City	Aachen
Period	25/06/17 → 30/06/17

Access to Document

10.1109/ISIT.2017.8006965

Cite this

Wang, C. Y., Bidokhti, S. S., & Wigger, M. (2017). Improved converses and gap-results for coded caching. In 2017 IEEE International Symposium on Information Theory, ISIT 2017 (pp. 2428-2432). Article 8006965 (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2017.8006965

@inproceedings{286e7e1bf1fa4bb694b40785c332c4a1,

title = "Improved converses and gap-results for coded caching",

abstract = "Improved lower bounds on the worst-case and the average-case rate-memory tradeoffs for the Maddah-Ali\&Niesen coded-caching scenario are presented. For any number of users and files and for arbitrary cache sizes, the multiplicative gap between the exact rate-memory tradeoff and the new lower bound is less than 2.315 in the worst-case scenario and less than 2.507 in the average-case scenario.",

author = "Wang, \{Chien Yi\} and Bidokhti, \{Shirin Saeedi\} and Michele Wigger",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",

year = "2017",

month = aug,

day = "9",

doi = "10.1109/ISIT.2017.8006965",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2428--2432",

booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",

}

Wang, CY, Bidokhti, SS & Wigger, M 2017, Improved converses and gap-results for coded caching. in 2017 IEEE International Symposium on Information Theory, ISIT 2017., 8006965, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 2428-2432, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 25/06/17. https://doi.org/10.1109/ISIT.2017.8006965

Improved converses and gap-results for coded caching. / Wang, Chien Yi; Bidokhti, Shirin Saeedi; Wigger, Michele.
2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 2428-2432 8006965 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Improved converses and gap-results for coded caching

AU - Wang, Chien Yi

AU - Bidokhti, Shirin Saeedi

AU - Wigger, Michele

PY - 2017/8/9

Y1 - 2017/8/9

N2 - Improved lower bounds on the worst-case and the average-case rate-memory tradeoffs for the Maddah-Ali&Niesen coded-caching scenario are presented. For any number of users and files and for arbitrary cache sizes, the multiplicative gap between the exact rate-memory tradeoff and the new lower bound is less than 2.315 in the worst-case scenario and less than 2.507 in the average-case scenario.

AB - Improved lower bounds on the worst-case and the average-case rate-memory tradeoffs for the Maddah-Ali&Niesen coded-caching scenario are presented. For any number of users and files and for arbitrary cache sizes, the multiplicative gap between the exact rate-memory tradeoff and the new lower bound is less than 2.315 in the worst-case scenario and less than 2.507 in the average-case scenario.

U2 - 10.1109/ISIT.2017.8006965

DO - 10.1109/ISIT.2017.8006965

M3 - Conference contribution

AN - SCOPUS:85034039703

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2428

EP - 2432

BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 IEEE International Symposium on Information Theory, ISIT 2017

Y2 - 25 June 2017 through 30 June 2017

ER -

Improved converses and gap-results for coded caching

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this