ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

On the Optimality of Two Decentralized Coded Caching Schemes With and Without Error Correction

Karat, NS and Bhargav, KLV and Rajan, BS (2020) On the Optimality of Two Decentralized Coded Caching Schemes With and Without Error Correction. In: 2020 IEEE International Symposium on Information Theory, ISIT 2020, 21-26 July 2020, Los Angeles; United States, pp. 1664-1669.

[img] PDF
iee_int_sym_inf_the_pro_2020_1664-1669_2020.pdf - Published Version
Restricted to Registered users only

Download (318kB) | Request a copy
Official URL: https://dx.doi.org/10.1109/ISIT44484.2020.9174115

Abstract

The decentralized coded caching was Introduced In M. A. Maddah-Ali and U. Niesen, "Decentralized coded caching attains order-optimal memory-rate tradeoff," IEEE/ACM Trans. Networking, Aug. 2015 in which no coordination is required for the content placement. This scheme is extended to all the demand cases and the optimality is shown in the literature under the uncoded prefetching regime using information theoretic lower bound. In this paper, an alternate proof for optimality is given using index coding techniques. Moreover, for the case when the shared broadcast link is error prone, an optimal error correcting delivery scheme is proposed for coded caching problems with the decentralized placement. Next, the Least Recently Sent (LRS) online coded caching scheme is considered. The optimality of this scheme is also proved using index coding techniques. An optimal error correcting delivery scheme is proposed for coded caching problems with the LRS online prefetching. © 2020 IEEE.

Item Type: Conference Paper
Publication: IEEE International Symposium on Information Theory - Proceedings
Publisher: Institute of Electrical and Electronics Engineers Inc.
Additional Information: The copyright of this article belongs to Institute of Electrical and Electronics Engineers Inc.
Keywords: Cache memory; Error correction, Caching scheme; Error prones; Index coding; Information-theoretic lower bounds; Optimal error; Optimal memory; Optimality; Prefetching, Information theory
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 28 Oct 2020 11:35
Last Modified: 28 Oct 2020 11:35
URI: http://eprints.iisc.ac.in/id/eprint/66611

Actions (login required)

View Item View Item