Coded caching with linear coded placement: Exact tradeoff for the three user case
Y Ma, D Tuninetti - 2023 59th Annual Allerton Conference on …, 2023 - ieeexplore.ieee.org
This paper studies the optimal memory-load trade-off in a coded caching system with K= 3
users under the constraint that the contents in the local caches are the result of encoding the …
users under the constraint that the contents in the local caches are the result of encoding the …
On the Generic Capacity of K-User Symmetric Linear Computation Broadcast
Linear computation broadcast (LCBC) refers to a setting with d dimensional data stored at a
central server, where K users, each with some prior linear side-information, wish to compute …
central server, where K users, each with some prior linear side-information, wish to compute …
New optimal trade-off point for coded caching systems with limited cache size
Y Ma, D Tuninetti - arXiv preprint arXiv:2310.07686, 2023 - arxiv.org
This paper presents a new achievable scheme for coded caching systems with $\mathsf {N}
$ files, $\mathsf {K}=\mathsf {N} $ users, and cache size $\mathsf {M}= 1/(\mathsf {N}-1) …
$ files, $\mathsf {K}=\mathsf {N} $ users, and cache size $\mathsf {M}= 1/(\mathsf {N}-1) …
The Inverted 3-Sum Box: General Formulation and Quantum Information Theoretic Optimality
The $ N $-sum box protocol specifies a class of $\mathbb {F} _d $ linear functions $ f
(W_1,\cdots, W_K)= V_1W_1+ V_2W_2+\cdots+ V_KW_K\in\mathbb {F} _d^{m\times 1} …
(W_1,\cdots, W_K)= V_1W_1+ V_2W_2+\cdots+ V_KW_K\in\mathbb {F} _d^{m\times 1} …
Capacity of 2-user linear computation broadcast with partially informed server
A linear computation broadcast (LCBC) setting is comprised of data that is stored at a server
and users who wish to retrieve their respective desired linear functions of the data, while …
and users who wish to retrieve their respective desired linear functions of the data, while …