Pith

open record

sign in

arxiv: 1702.04834 · v2 · pith:FGPSCKOI · submitted 2017-02-16 · cs.IT · math.IT

Improved Converses and Gap Results for Coded Caching

Chien-Yi Wang , Shirin Saeedi Bidokhti , Michele Wigger This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:FGPSCKOIrecord.jsonopen to challenge →

classification cs.IT math.IT
keywords scenariocachingcodedimprovedlesslowerrate-memoryworst-case
0
0 comments X
read the original abstract

Improved lower bounds on the average and the worst-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.

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.