Optimal Error Correcting Delivery Scheme for an Optimal Coded Caching Scheme with Small Buffers

Karat, Nujoom Sageer and Thomas, Anoop and Rajan, B Sundar (2018) Optimal Error Correcting Delivery Scheme for an Optimal Coded Caching Scheme with Small Buffers. In: IEEE International Symposium on Information Theory (ISIT), JUN 17-22, 2018, Vail, CO, pp. 1710-1714.

PDF ISIT_1716_2018.pdf - Published Version Restricted to Registered users only Download (578kB) | Request a copy

Abstract

Optimal delivery scheme for coded caching problems with small buffer sizes and the number of users no less than the amount of files in the server was proposed by Chen, Fan and Letaief ''Fundamental limits of caching: improved bounds for users with small buffers,'' IET Communications, 2016]. This scheme is referred to as the CFL scheme. In this paper, an extension to the coded caching scheme where the link between the server and the users is error prone, is considered. The delivery phase is error prone and the placement phase is considered to be error free. The closed form expressions for average rate and peak rate of error correcting delivery scheme are found for CFL prefetching scheme using techniques from index coding. For a given demand, the delivery phase of a coded caching problem becomes an index coding problem. Using results from error correcting index coding, an optimal linear error correcting delivery scheme for caching problems employing CFL prefetching is proposed.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE
Additional Information:	IEEE International Symposium on Information Theory (ISIT), Vail, CO, JUN 17-22, 2018
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	24 Nov 2018 14:29
Last Modified:	24 Nov 2018 14:29
URI:	http://eprints.iisc.ac.in/id/eprint/61135

Actions (login required)

View Item