A transformation from non-private single-demand caching yields an order-optimal scheme for demand-private multi-demand coded caching within a factor of 6.
Then, we have K ¯N r − K ¯N−L r K ¯N r N≤ N Lr K ¯N ≤ N−L(t−1) s =M s,t, which shows that the corresponding memory size in Theo- rem 1 is no larger thanM s,t
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 Demand-Private Coded Caching With Multiple Demands
A transformation from non-private single-demand caching yields an order-optimal scheme for demand-private multi-demand coded caching within a factor of 6.