Next Article in Journal
Causal Geometry
Next Article in Special Issue
On Grid Quorums for Erasure Coded Data
Previous Article in Journal
Causal Intuition and Delayed-Choice Experiments
Previous Article in Special Issue
Optimal Linear Error Correcting Delivery Schemes for Two Optimal Coded Caching Schemes
Open AccessFeature PaperArticle

Cache-Aided General Linear Function Retrieval

Electrical Engineering and Computer Science Department, Technische Universität Berlin, 10587 Berlin, Germany
Department of Electrical Engineering, University of North Texas, Denton, TX 76203, USA
Electrical and Computer Engineering Department, University of Utah, Salt Lake City, UT 84112, USA
Electrical and Computer Engineering Department, University of Illinois Chicago, Chicago, IL 60607, USA
Author to whom correspondence should be addressed.
Entropy 2021, 23(1), 25;
Received: 7 November 2020 / Revised: 22 December 2020 / Accepted: 22 December 2020 / Published: 26 December 2020
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. View Full-Text
Keywords: coded caching; linear function retrieval; uncoded cache placement coded caching; linear function retrieval; uncoded cache placement
Show Figures

Figure 1

MDPI and ACS Style

Wan, K.; Sun, H.; Ji, M.; Tuninetti, D.; Caire, G. Cache-Aided General Linear Function Retrieval. Entropy 2021, 23, 25.

AMA Style

Wan K, Sun H, Ji M, Tuninetti D, Caire G. Cache-Aided General Linear Function Retrieval. Entropy. 2021; 23(1):25.

Chicago/Turabian Style

Wan, Kai; Sun, Hua; Ji, Mingyue; Tuninetti, Daniela; Caire, Giuseppe. 2021. "Cache-Aided General Linear Function Retrieval" Entropy 23, no. 1: 25.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Search more from Scilit
Back to TopTop