IIIT Hyderabad Publications |
|||||||||
|
Coded Caching based on Combinatorial DesignsAuthors: Shailja Agarwal,K V Sushena Sree,Prasad Krishnan Conference: 2019 IEEE International Symposium on Information Theory Location Paris Date: 2019-07-07 Report no: IIIT/TR/2019/16 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.The centralized coded caching framework, consists of a cachingphase and a delivery phase, both of which are carefully designedin order to use the cache and the channel together optimally. Inprior literature, various combinatorial structures have been usedto construct coded caching schemes. In this work, we proposea binary matrix model to construct the coded caching scheme.The ones in such acaching matrixindicate uncached subfiles atthe users. Identity submatrices of the caching matrix representtransmissions in the delivery phase. Using this model, we thenpropose several novel constructions for coded caching based onthe various types of combinatorial designs. While most of theschemes constructed in this work (based on existing designs)have a high cache requirement (uncached fraction beingΘ(1√K),Kbeing the number of users), they provide a rateRthatis upper bounded by a constant (R≤1) with increasingK,and moreover require extremely small levels of subpacketization(beingO(K)), which is an extremely important parameter inpractical applications of coded caching Full paper: pdf Centre for Communications |
||||||||
Copyright © 2009 - IIIT Hyderabad. All Rights Reserved. |