Coded Caching Schemes with Reduced Subpacketization from Linear Block Codes
From MaRDI portal
Publication:4570876
zbMATH Open1392.94935arXiv1706.00101MaRDI QIDQ4570876FDOQ4570876
Publication date: 9 July 2018
Abstract: Coded caching is a technique that generalizes conventional caching and promises significant reductions in traffic over caching networks. However, the basic coded caching scheme requires that each file hosted in the server be partitioned into a large number (i.e., the subpacketization level) of non-overlapping subfiles. From a practical perspective, this is problematic as it means that prior schemes are only applicable when the size of the files is extremely large. In this work, we propose coded caching schemes based on combinatorial structures called resolvable designs. These structures can be obtained in a natural manner from linear block codes whose generator matrices possess certain rank properties. We obtain several schemes with subpacketization levels substantially lower than the basic scheme at the cost of an increased rate. Depending on the system parameters, our approach allows us to operate at various points on the subpacketization level vs. rate tradeoff.
Full work available at URL: https://arxiv.org/abs/1706.00101
Cited In (1)
This page was built for publication: Coded Caching Schemes with Reduced Subpacketization from Linear Block Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570876)
