A new combinatorial structure, non-half-sum disjoint packing, yields coded caching schemes with F=K linear subpacketization and transmission load R=product of block counts, improving on several earlier linear-subpacketization designs.
A coded caching scheme with linear sub-packetization and its application to multi- access coded caching,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Disjoint Packing
A new combinatorial structure, non-half-sum disjoint packing, yields coded caching schemes with F=K linear subpacketization and transmission load R=product of block counts, improving on several earlier linear-subpacketization designs.