pith. sign in

arxiv: 1901.03188 · v1 · pith:X4AF4DEPnew · submitted 2019-01-08 · 💻 cs.IT · math.IT

An Optimal Linear Error Correcting Delivery Scheme for Coded Caching with Shared Caches

classification 💻 cs.IT math.IT
keywords schemecachingcasedeliveryratecachecodedcorrecting
0
0 comments X
read the original abstract

Classical coded caching setting avails each user to have one dedicated cache. This is generalized to a more general shared cache scheme and the exact expression for the worst case rate was derived in [E. Parrinello, A. Unsal, P. Elia, "Fundamental Limits of Caching in Heterogeneous Networks with Uncoded Prefetching," available on arXiv:1811.06247 [cs.IT], Nov. 2018]. For this case, an optimal linear error correcting delivery scheme is proposed and an expression for the peak rate is established for the same. Furthermore, a new delivery scheme is proposed, which gives an improved rate for the case when the demands are not distinct.

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.