Caching and Delivery via Interference Elimination
From MaRDI portal
Publication:4566727
Abstract: We propose a new caching scheme where linear combinations of the file segments are cached at the users, for the cases where the number of files is no greater than the number of users. When a user requests a certain file in the delivery phase, the other file segments in the cached linear combinations can be viewed as interferences. The proposed scheme combines rank metric codes and maximum distance separable codes to facilitate the decoding and elimination of these interferences, and also to simultaneously deliver useful contents to the intended users. The performance of the proposed scheme can be explicitly evaluated, and we show that the tradeoff points achieved by this scheme can strictly improve known tradeoff inner bounds in the literature; for certain special cases, the new tradeoff points can be shown to be optimal.
Recommendations
- Cache-Aided Interference Channels
- Fundamental Limits of Non-Coherent Interference Alignment via Matroid Theory
- Fundamental Tradeoff Between Storage and Latency in Cache-Aided Wireless Interference Networks
- Content Delivery in Erasure Broadcast Channels With Cache and Feedback
- Caching in Wireless Networks
- Efficient coded-block delivery and caching in information-centric networking
- A Rate-Distortion Approach to Caching
- Coded Caching and Content Delivery With Heterogeneous Distortion Requirements
- Rate-Memory Trade-Off for Caching and Delivery of Correlated Sources
- scientific article; zbMATH DE number 1445331
This page was built for publication: Caching and Delivery via Interference Elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566727)
