The paper gives a binary-matrix equivalence for placement delivery arrays and uses it to construct coded caching schemes with subpacketization as low as linear in the number of users, at a quantified rate penalty.
Fundamental limits of ca ching,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Some new Constructions of Coded Caching Schemes with Reduced Subpacketization
The paper gives a binary-matrix equivalence for placement delivery arrays and uses it to construct coded caching schemes with subpacketization as low as linear in the number of users, at a quantified rate penalty.