Error Correction in Coded Caching With Symmetric Batch Prefetching

Karat, Nujoom Sageer; Thomas, Anoop; Rajan, B. Sundar

doi:10.1109/tcomm.2019.2916556

Cited by 13 publications

(11 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [ 19 ], index coding techniques are used for caching problems to obtain solutions meeting outer bounds. The connections between index coding and coded caching are also used to design optimal error correcting delivery schemes for coded caching problems in [ 20 , 21 , 22 , 23 ].…”

Section: Introductionmentioning

confidence: 99%

Generalized Index Coding Problem and Discrete Polymatroids

Thomas

Rajan

2020

Entropy

Self Cite

View full text Add to dashboard Cite

The connections between index coding and matroid theory have been well studied in the recent past. Index coding solutions were first connected to multi linear representation of matroids. For vector linear index codes, discrete polymatroids, which can be viewed as a generalization of the matroids, were used. The index coding problem has been generalized recently to accommodate receivers that demand functions of messages and possess functions of messages. In this work we explore the connections between generalized index coding and discrete polymatroids. The conditions that need to be satisfied by a representable discrete polymatroid for a generalized index coding problem to have a vector linear solution is established. From a discrete polymatroid, an index coding problem with coded side information is constructed and it is shown that if the index coding problem has a certain optimal length solution then the discrete polymatroid is representable. If the generalized index coding problem is constructed from a matroid, it is shown that the index coding problem has a binary scalar linear solution of optimal length if and only if the matroid is binary representable.

show abstract

Section: Introductionmentioning

confidence: 99%

Generalized Index Coding Problem and Discrete Polymatroids

Thomas

Rajan

2020

Entropy

Self Cite

View full text Add to dashboard Cite

show abstract

“…A work that is closely related to this work is present in [ 15 ] and its extended version [ 21 ]. In [ 21 ], error correction is considered for a particular class of uncoded prefetching, namely symmetric batch prefetching. The major distinctions of this paper with the work in [ 21 ] are as follows.…”

Section: Introductionmentioning

confidence: 99%

“…In [ 21 ], error correction is considered for a particular class of uncoded prefetching, namely symmetric batch prefetching. The major distinctions of this paper with the work in [ 21 ] are as follows. This is the first paper in the literature that considers error correction for coded caching schemes with coded prefetching.…”

Section: Introductionmentioning

confidence: 99%

“…This is the first paper in the literature that considers error correction for coded caching schemes with coded prefetching. On the other hand, the work in [ 21 ] involves uncoded prefetching. For a fixed demand, the delivery scheme of a coded caching problem with uncoded prefetching is an index coding problem [ 22 ].…”

Section: Introductionmentioning

confidence: 99%

“…When the prefetching is coded, it corresponds to a generalized index coding problem [ 23 ]. To derive bounds in [ 21 ], the concepts of index coding are used and, to derive the bounds in this paper, we use techniques from generalized index coding. This paper is the first to use the concepts of generalized index coding to derive bounds for coded caching problems.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimal Linear Error Correcting Delivery Schemes for Two Optimal Coded Caching Schemes

Karat

Thomas

Rajan

2020

Entropy

Self Cite

View full text Add to dashboard Cite

For coded caching problems with small buffer sizes and the number of users no less than the amount of files in the server, an optimal delivery scheme was proposed by Chen, Fan, and Letaief in 2016. This scheme is referred to as the CFL scheme. In this paper, an extension to the coded caching problem where the link between the server and the users is error prone, is considered. The closed form expressions for average rate and peak rate of error correcting delivery scheme are found for the CFL prefetching scheme using techniques from index coding. Using results from error correcting index coding, an optimal linear error correcting delivery scheme for caching problems employing the CFL prefetching is proposed. Another scheme that has lower sub-packetization requirement as compared to CFL scheme for the same cache memory size was considered by J. Gomez-Vilardebo in 2018. An optimal linear error correcting delivery scheme is also proposed for this scheme.

show abstract

Decentralized coded caching for shared caches using erasure coding

Dutta,

Thomas

2024

Physical Communication

View full text Add to dashboard Cite

Error Correction in Coded Caching With Symmetric Batch Prefetching

Cited by 13 publications

References 26 publications

Generalized Index Coding Problem and Discrete Polymatroids

Generalized Index Coding Problem and Discrete Polymatroids

Optimal Linear Error Correcting Delivery Schemes for Two Optimal Coded Caching Schemes

Decentralized coded caching for shared caches using erasure coding

Contact Info

Product

Resources

About