Optimal Error Correcting Delivery Scheme for Coded Caching with Symmetric Batch Prefetching

TL;DR

This paper develops an optimal error-correcting delivery scheme for coded caching with symmetric batch prefetching, addressing error-prone shared links and deriving closed-form expressions for minimum rates.

Contribution

It introduces a novel error-correcting delivery scheme tailored for symmetric batch prefetching in coded caching, optimizing performance over error-prone links.

Findings

Derived closed-form expressions for minimum average and peak rates.

Proposed an optimal error-correcting delivery scheme for the specified caching setup.

Addressed the challenge of reliable delivery over error-prone shared links.

Abstract

Coded caching is used to reduce network congestion during peak hours. A single server is connected to a set of users through a bottleneck link, which generally is assumed to be error-free. During non-peak hours, all the users have full access to the files and they fill their local cache with portions of the files available. During delivery phase, each user requests a file and the server delivers coded transmissions to meet the demands taking into consideration their cache contents. In this paper we assume that the shared link is error prone. A new delivery scheme is required to meet the demands of each user even after receiving finite number of transmissions in error. We characterize the minimum average rate and minimum peak rate for this problem. We find closed form expressions of these rates for a particular caching scheme namely \textit{symmetric batch prefetching}. We also propose an optimal error correcting delivery scheme for coded caching problem with symmetric batch prefetching.