A Note on the Fundamental Limits of Coded Caching
A Note on the Fundamental Limits of Coded Caching
复制标题
关于编码缓存基本限制的说明
DOI:
--
复制
发表时间:
2015
期刊:
影响因子:
--
通讯作者:
C. Tian
中科院分区:
文献类型:
--
作者:
C. Tian
The fundamental limit of coded caching is investigated for the case with $N=3$ files and $K=3$ users. An improved outer bound is obtained through the computational approach developed by the author in an earlier work. This result is part of the online collection of "Solutions of Computed Information Theoretic Limits (SCITL)".