Coded Caching via Line Graphs of Bipartite Graphs
Prasad Krishnan

TL;DR
This paper introduces a novel coded caching scheme based on line graphs of bipartite graphs, achieving low subpacketization and uncached fractions by leveraging graph theory and projective geometry.
Contribution
It develops a new graph-theoretic framework for coded caching, providing explicit constructions with bounded rate and subpacketization using projective geometry.
Findings
Rate bounded by a constant with subpacketization $q^{O((log_qK)^2)}$
Uncached fraction $ heta(1/\sqrt{K})$
Provides a subpacketization-dependent lower bound
Abstract
We present a coded caching framework using line graphs of bipartite graphs. A clique cover of the line graph describes the uncached subfiles at users. A clique cover of the complement of the square of the line graph gives a transmission scheme that satisfies user demands. We then define a specific class of such caching line graphs, for which the subpacketization, rate, and uncached fraction of the coded caching problem can be captured via its graph theoretic parameters. We present a construction of such caching line graphs using projective geometry. The presented scheme has a rate bounded from above by a constant with subpacketization level and uncached fraction , where is the number of users and is a prime power. We also present a subpacketization-dependent lower bound on the rate of coded caching schemes for a given broadcast…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
