A Novel Scheme for Coded Caching with Coded Placement in Small Memory Regime (2404.17767v2)
Abstract: This paper presents a novel achievable scheme for coded caching systems with $N$ files and $K$ users, specifically when $N \leq K$. This new scheme employs linear coding both during the placement phase - where cache contents are linear combinations of files from the library - and the delivery phase. The multi-step delivery phase enables users to decode the cached coded content and eliminate interference effectively. In the small memory regime, the proposed scheme outperforms existing methods, particularly when $K$ and $N$ values are similar, it maintains manageable sub-packetization levels, and operates over a finite field of size $3$ regardless of the system parameters.
- M. A. Maddah-Ali and U. Niesen, “Fundamental limits of caching,” IEEE Transactions on Information Theory, vol. 60, no. 5, pp. 2856–2867, 2014.
- K. Wan, D. Tuninetti, and P. Piantanida, “An index coding approach to caching with uncoded cache placement,” IEEE Transactions on Information Theory, vol. 66, no. 3, pp. 1318–1332, 2020.
- Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “The exact rate-memory tradeoff for caching with uncoded prefetching,” IEEE Transactions on Information Theory, vol. 64, no. 2, pp. 1281–1296, 2017.
- Z. Chen, P. Fan, and K. B. Letaief, “Fundamental limits of caching: Improved bounds for users with small buffers,” IET Communications, vol. 10, no. 17, pp. 2315–2318, 2016.
- Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Characterizing the rate-memory tradeoff in cache networks within a factor of 2,” IEEE Transactions on Information Theory, vol. 65, no. 1, pp. 647–663, 2018.
- C. Tian, “Symmetry, outer bounds, and code constructions: A computer-aided investigation on the fundamental limits of caching,” Entropy, vol. 20, no. 8, p. 603, 2018.
- C. Tian and J. Chen, “Caching and delivery via interference elimination,” IEEE Transactions on Information Theory, vol. 64, no. 3, pp. 1548–1560, 2018.
- Y. Ma and D. Tuninetti, “Coded caching with linear coded placement: Exact tradeoff for the three user case,” in 2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton), IEEE, 2023.
- Y. Ma and D. Tuninetti, “New optimal trade-off point for coded caching systems with limited cache size,” arXiv preprint arXiv:2310.07686, 2023.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.