| Paper ID | D6-S6-T1.2 |
| Paper Title |
A General Coded Caching Scheme for Scalar Linear Function Retrieval |
| Authors |
Yinbin Ma, Daniela Tuninetti, University of Illinois at Chicago, United States |
| Session |
D6-S6-T1: Coded Caching for Computing |
| Chaired Session: |
Monday, 19 July, 23:40 - 00:00 |
| Engagement Session: |
Tuesday, 20 July, 00:00 - 00:20 |
| Abstract |
Coded caching aims to minimize network peak load by leveraging the side information stored in users. Kai et al. proposed a feasible scheme for the coded caching model with linear function retrieval, which achieves the optimal load under the constraint of uncoded placement. However, the question to characterize both encoding and decoding coefficients remains to be solved. We reason these coefficients with graphs and show that these constraints among the coefficients essentially are cycles in graphs. By solving these constraints with spanning trees, we obtain a general scheme for the linear retrieval problem.
|
