Characterizing Linear Memory-Rate Tradeoff of Coded Caching: The (N,K)=(3,3) Case

05/12/2020
by   Daming Cao, et al.
0

We consider the cache problem introduced by Maddah-ali and Niesen [1] for the (N,K)=(3,3) case, and use the computer-aided approach to derive the tight linear memory-rate trade-off. Two lower bounds 10M+6R≥ 15 and 5M+4R≥ 9 are proved, which are non-Shannon type. A coded linear scheme of point (M,R)=(0.6,1.5) is constructed with the help of symmetry reduction and brute-force search.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/09/2021

The Exact Rate Memory Tradeoff for Small Caches with Coded Placement

The idea of coded caching was introduced by Maddah-Ali and Niesen who de...
research
01/24/2021

The Exact Rate Memory Tradeoff for Large Caches with Coded Placement

The idea of coded caching for content distribution networks was introduc...
research
01/22/2022

An Improved Lower Bound for Multi-Access Coded Caching

The multi-access variant of the coded caching problem with N files, K us...
research
01/02/2020

Subexponential and Linear Subpacketization Coded Caching via Line Graphs and Projective Geometry

Large gains in the rate of cache-aided broadcast communication are obtai...
research
04/25/2022

Coordination and Discoordination in Linear Algebra, Linear Information Theory, and Coded Caching

In the first part of this paper we develop some theorems in linear algeb...
research
03/17/2021

Memory-Rate Tradeoff for Caching with Uncoded Placement under Nonuniform Random Demands

For a caching system with multiple users, we aim to characterize the mem...

Please sign up or login with your details

Forgot password? Click here to reset