当前位置: X-MOL 学术arXiv.cs.IT › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Coded Caching with Polynomial Subpacketization
arXiv - CS - Information Theory Pub Date : 2020-01-20 , DOI: arxiv-2001.07020
Wentu Song, Kui Cai, and Long Shi

Consider a centralized caching network with a single server and $K$ users. The server has a database of $N$ files with each file being divided into $F$ packets ($F$ is known as subpacketization), and each user owns a local cache that can store $\frac{M}{N}$ fraction of the $N$ files. We construct a family of centralized coded caching schemes with polynomial subpacketization. Specifically, given $M$, $N$ and an integer $n\geq 0$, we construct a family of coded caching schemes for any $(K,M,N)$ caching system with $F=O(K^{n+1})$. More generally, for any $t\in\{1,2,\cdots,K-2\}$ and any integer $n$ such that $0\leq n\leq t$, we construct a coded caching scheme with $\frac{M}{N}=\frac{t}{K}$ and $F\leq K\binom{\left(1-\frac{M}{N}\right)K+n}{n}$.

中文翻译:

多项式子分组化的编码缓存

考虑一个具有单个服务器和 $K$ 用户的集中缓存网络。服务器有一个$N$文件的数据库,每个文件被分成$F$个包($F$被称为子包化),每个用户拥有一个本地缓存,可以存储$\frac{M}{N}$ $N$ 文件的一部分。我们构建了一系列具有多项式子分组化的集中式编码缓存方案。具体来说,给定 $M$、$N$ 和整数 $n\geq 0$,我们为任何 $(K,M,N)$ 缓存系统构建了一系列编码缓存方案,其中 $F=O(K^{ n+1})$。更一般地,对于任何 $t\in\{1,2,\cdots,K-2\}$ 和任何整数 $n$ 使得 $0\leq n\leq t$,我们用 $\ frac{M}{N}=\frac{t}{K}$ 和 $F\leq K\binom{\left(1-\frac{M}{N}\right)K+n}{n}$ .
更新日期:2020-01-22
down
wechat
bug