The work provides achievable and converse bounds on worst-case load for decentralized coded caching using independent random linear coding placement that coincide under certain conditions.
Characterizing the rate-memory tradeoff in cache networks within a factor of 2
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Coded Caching Systems with Decentralized Linear Coding Placement
The work provides achievable and converse bounds on worst-case load for decentralized coded caching using independent random linear coding placement that coincide under certain conditions.