Cache-aided General Linear Function Retrieval

Coded Caching, proposed by Maddah-Ali and Niesen (MAN), has the potential to reduce network traffic by pre-storing content in the users' local memories when the network is underutilized and transmitting coded multicast messages that simultaneously benefit many users at once during peak-hour times. This paper considers the linear function retrieval version of the original coded caching setting, where users are interested in retrieving a number of linear combinations of the data points stored at the server, as opposed to a single file. This extends the scope of the authors' past work that only considered the class of linear functions that operate element-wise over the files. On observing that the existing cache-aided scalar linear function retrieval scheme does not work in the proposed setting, this paper designs a novel coded caching scheme that outperforms uncoded caching schemes that either use unicast transmissions or let each user recover all files in the library.

[1]  Giuseppe Caire,et al.  Cache-Aided Matrix Multiplication Retrieval , 2021, 2021 IEEE International Symposium on Information Theory (ISIT).

[2]  Jaber Kakar,et al.  Uplink-Downlink Tradeoff in Secure Distributed Matrix Multiplication , 2019, ArXiv.

[3]  Alexandros G. Dimakis,et al.  Index Coding With Coded Side-Information , 2015, IEEE Communications Letters.

[4]  Giuseppe Caire,et al.  On the Optimality of D2D Coded Caching With Uncoded Cache Placement and One-Shot Delivery , 2019, IEEE Transactions on Communications.

[5]  Giuseppe Caire,et al.  On Coded Caching With Private Demands , 2019, IEEE Transactions on Information Theory.

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

[7]  Ravi Tandon,et al.  On the Upload versus Download Cost for Secure and Private Matrix Multiplication , 2019, 2019 IEEE Information Theory Workshop (ITW).

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

[9]  Mohammad Ali Maddah-Ali,et al.  Characterizing the rate-memory tradeoff in cache networks within a factor of 2 , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[10]  Daniela Tuninetti,et al.  Fundamental Limits of Caching for Demand Privacy Against Colluding Users , 2020, IEEE Journal on Selected Areas in Information Theory.

[11]  Daniela Tuninetti,et al.  Key Superposition Simultaneously Achieves Security and Privacy in Cache-Aided Linear Function Retrieval , 2020, 2020 IEEE Information Theory Workshop (ITW).

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

[13]  Sem C. Borst,et al.  Distributed Caching Algorithms for Content Distribution Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[14]  Syed A. Jafar,et al.  Cross Subspace Alignment Codes for Coded Distributed Batch Computation. , 2019 .

[15]  Giuseppe Caire,et al.  On Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval , 2020, ArXiv.

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

[17]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2006, IEEE Transactions on Information Theory.

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

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