Linear Coded Caching Scheme for Centralized Networks

Coded caching systems have been widely studied to reduce the data transmission during the peak traffic time. In practice, two important parameters of a coded caching system should be considered, i.e., the rate which is the maximum amount of the data transmission during the peak traffic time, and the subpacketization level, the number of divided packets of each file when we implement a coded caching scheme. We prefer to design a scheme with rate and packet number as small as possible since they reflect the transmission efficiency and complexity of the caching scheme, respectively. In this paper, we first characterize a coded caching scheme from the viewpoint of linear algebra and show that designing a linear coded caching scheme is equivalent to constructing three classes of matrices satisfying some rank conditions. Then based on the invariant linear subspaces and combinatorial design theory, several classes of new coded caching schemes over $\mathbb{F}_2$ are obtained by constructing these three classes of matrices. It turns out that the rate of our new rate is the same as the scheme construct by Yan et al. (IEEE Trans. Inf. Theory 63, 5821-5833, 2017), but the packet number is significantly reduced. A concatenating construction then is used for flexible number of users. Finally by means of these matrices, we show that the minimum storage regenerating codes can also be used to construct coded caching schemes.

[1]  Hooshang Ghasemi,et al.  Further results on lower bounds for coded caching , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[2]  Prasad Krishnan,et al.  Coded Caching via Line Graphs of Bipartite Graphs , 2018, 2018 IEEE Information Theory Workshop (ITW).

[3]  A. Salman Avestimehr,et al.  The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching , 2016, IEEE Transactions on Information Theory.

[4]  Mohammad Mohammadi Amiri,et al.  Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Trade-off , 2016 .

[5]  Jaime Llorca,et al.  Finite-Length Analysis of Caching-Aided Coded Multicasting , 2014, IEEE Transactions on Information Theory.

[6]  Jaime Llorca,et al.  A unified Ruzsa-Szemerédi framework for finite-length coded caching , 2017, 2017 51st Asilomar Conference on Signals, Systems, and Computers.

[7]  T. Charles Clancy,et al.  Fundamental Limits of Caching With Secure Delivery , 2013, IEEE Transactions on Information Forensics and Security.

[8]  Xiaohu Tang,et al.  Placement Delivery Array Design Through Strong Edge Coloring of Bipartite Graphs , 2016, IEEE Communications Letters.

[9]  Giuseppe Caire,et al.  Uncoded placement optimization for coded delivery , 2017, 2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[10]  Urs Niesen,et al.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[11]  Giuseppe Caire,et al.  Fundamental Limits of Caching in Wireless D2D Networks , 2014, IEEE Transactions on Information Theory.

[12]  Daniela Tuninetti,et al.  Caching in Combination Networks: Novel Multicast Message Generation and Delivery by Leveraging the Network Topology , 2018, 2018 IEEE International Conference on Communications (ICC).

[13]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[14]  Suhas N. Diggavi,et al.  Hierarchical coded caching , 2014, 2014 IEEE International Symposium on Information Theory.

[15]  T. Charles Clancy,et al.  Improved approximation of storage-rate tradeoff for caching via new outer bounds , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[16]  Daniela Tuninetti,et al.  On the optimality of uncoded cache placement , 2015, 2016 IEEE Information Theory Workshop (ITW).

[17]  Li Tang,et al.  Coded Caching Schemes With Reduced Subpacketization From Linear Block Codes , 2017, IEEE Transactions on Information Theory.

[18]  Xiaohu Tang,et al.  Coded Caching Schemes with Low Rate and Subpacketizations , 2017 .

[19]  Jehoshua Bruck,et al.  Long MDS codes for optimal repair bandwidth , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[20]  Minquan Cheng,et al.  Some Variant of Known Coded Caching Schemes With Good Performance , 2020, IEEE Transactions on Communications.

[21]  Xiaohu Tang,et al.  Coded caching schemes for Flexible Memory Sizes , 2017, ArXiv.

[22]  Antonia Maria Tulino,et al.  Coded caching with linear subpacketization is possible using Ruzsa-Szeméredi graphs , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[23]  Urs Niesen,et al.  Online Coded Caching , 2013, IEEE/ACM Transactions on Networking.

[24]  Xiaohu Tang,et al.  Optimal Placement Delivery Arrays with Minimum Number of Rows , 2017, ArXiv.

[25]  Daniela Tuninetti,et al.  An Index Coding Approach to Caching With Uncoded Cache Placement , 2020, IEEE Transactions on Information Theory.

[26]  Xiaohu Tang,et al.  On the Placement Delivery Array Design for Centralized Coded Caching Scheme , 2015, IEEE Transactions on Information Theory.

[27]  Gennian Ge,et al.  Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach , 2016, IEEE Transactions on Information Theory.

[28]  Jehoshua Bruck,et al.  Access Versus Bandwidth in Codes for Storage , 2014, IEEE Transactions on Information Theory.

[29]  Qiang Wang,et al.  A Generalized Grouping Scheme in Coded Caching , 2019, IEEE Transactions on Communications.

[30]  Urs Niesen,et al.  Fundamental limits of caching , 2012, 2013 IEEE International Symposium on Information Theory.

[31]  Jehoshua Bruck,et al.  Zigzag Codes: MDS Array Codes With Optimal Rebuilding , 2011, IEEE Transactions on Information Theory.

[32]  Michael Gastpar,et al.  A new converse bound for coded caching , 2016, 2016 Information Theory and Applications Workshop (ITA).

[33]  Jaime Llorca,et al.  On the fundamental limits of caching in combination networks , 2015, 2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[34]  Minquan Cheng,et al.  A Novel Recursive Construction for Coded Caching Schemes , 2017, ArXiv.