6 problems

Secure coded caching involves a server storing messages and users with local caches who request messages over a broadcast link, while secure index coding involves an adversary that…

Let a linear scheme be a scheme in the coded-caching setting, and call it separated when it has the separability property used in the paper. Separation conjecture. Any optimal line…

Let $M$ and $R$ denote the normalized memory and rate of a linear scheme, respectively, and let $N=K=3$. The linear-scheme bound conjecture. Every linear scheme satisfies … The con…

Consider a multi-access coded-caching system with $K$ caches, cache parameter $z$, and an integer $k$ indexing the achievable points described in Theorem 1. The plotted achievable-…

Consider the non-uniform centralized caching problem with two files, using the paper's general placement scheme and the lower bound developed for the delivery rate. Achievability c…

Let there be multiple libraries with cache-allocation parameters $\alpha^{(\ell)}$ and library sizes $N_\ell$. Consider the memory-sharing strategy that incrementally allocates cac…