Fundamental limits of caching: Improved rate-memory tradeoff with coded prefetching
Por:
Gomez-Vilardebo, J
Publicada:
1 ene 2018
Categoría:
Electrical and electronic engineering
Resumen:
We consider a cache network, in which a single server is connected to multiple users via a shared error free link. The server has access to a database with N files of equal length F, and serves K users each with a cache memory of MF bits. A novel centralized coded caching scheme is proposed for scenarios with more users than files N = K and cache capacities satisfying (1/K) = M = (N/K). The proposed scheme outperforms the best rate-memory region known in the literature if N = K = ((N2+1)/2). © 2018 IEEE.
Filiaciones:
Gomez-Vilardebo, J:
Ctr Tecnol Telecomunicac Catalunya, Barcelona 08860, Spain
Green Submitted, All Open Access; Green Open Access
|