IIIT Hyderabad Publications |
|||||||||
|
arXiv:1901.06383v2 [cs.IT] 23 Jan 2019Coded Caching based on Combinatorial DesignsAuthors: Shailja Agarwal,K V Sushena Sree,Prasad Krishnan Conference: arXiv:1901.06383v2 [cs.IT] 23 Jan 2019Coded Caching based on Combinatorial Designs ((ISIT) 2019) Location Paris, France Date: 2019-07-07 Report no: IIIT/TR/2019/61 AbstractWe consider the standard broadcast setup with asingle server broadcasting information to a number of clients,each of which contains local storage (calledcache) of some size,which can store some parts of the available files at the server. Thecentralized coded caching framework, introduced in [1], consistsof a caching phase and a delivery phase, both of which arecarefully designed in order to use the cache and the channeltogether optimally. Starting from [1], various combinatorialstructures have been used to construct coded caching schemes.In this work, we propose a binary matrix model to construct thecoded caching scheme. The ones in such acaching matrixindicateuncached subfiles at the users. Identity submatrices of the cachingmatrix represent transmissions in the delivery phase. Using thismodel, we then propose several novel constructions for codedcaching based on the various types of combinatorial designs.While most of the schemes constructed in this work (basedon existing designs) have a high cache requirement (uncachedfraction beingΘ(1√K)orΘ(1K),Kbeing the number of users),they provide a rate that is either constant or decreasing (O(1K))with increasingK, and moreover require competitively smalllevels of subpacketization (beingO(Ki),1≤i≤3), which is anextremely important parameter in practical applications of codedcaching. We mark this work as another attempt to exploit thewell-developed theory of combinatorial designs for the problem ofconstructing caching schemes, utilizing the binary caching modelwe develop. Full paper: pdf Centre for Communications |
||||||||
Copyright © 2009 - IIIT Hyderabad. All Rights Reserved. |