Error Correction in Coded Caching With Symmetric Batch Prefetching

被引:12
作者
Karat, Nujoom Sageer [1 ]
Thomas, Anoop [1 ,2 ]
Rajan, B. Sundar [1 ]
机构
[1] Indian Inst Sci, Dept Elect Commun Engn, Bangalore 560012, Karnataka, India
[2] IIT Bhubaneswar, Sch Elect Sci, Bhubaneswar 752050, Odisha, India
关键词
Coded caching; error correction; index coding; FUNDAMENTAL LIMITS;
D O I
10.1109/TCOMM.2019.2916556
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In coded caching, a single server is connected to a set of users through a shared bottleneck link, which is assumed to be error free. During non-peak hours, all the users fill their local cache with portions of the files available. During the delivery phase, each user requests a file and the server delivers coded transmissions to meet the demands. In this paper, the links between the server and the users are assumed to be error prone. Prefetching errors are also considered. A new delivery scheme is required to meet the demands of each user even after receiving a finite number of transmissions in error in the presence of erroneous portions of files in the cache. The minimum average rate and minimum peak rate for this problem are characterized. Closed form expressions for average and peak rates for a particular caching scheme, namely, symmetric batch prefetching are established when there are no prefetching errors. An optimal linear error correcting delivery scheme is proposed for coded caching problems with symmetric batch prefetching in the absence of prefetching errors. In addition to this, lower bounds are established for the optimal rate required when there are prefetching errors in symmetric batch prefetching.
引用
收藏
页码:5264 / 5274
页数:11
相关论文
共 29 条
[1]   Broadcasting with side information [J].
Alon, Noga ;
Hassidim, Avinatan ;
Lubetzky, Eyal ;
Stav, Uri ;
Weinstein, Amit .
PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, :823-+
[2]   Index Coding With Side Information [J].
Bar-Yossef, Ziv ;
Birk, Yitzhak ;
Jayram, T. S. ;
Kol, Tomer .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (03) :1479-1494
[3]   Noisy Broadcast Networks With Receiver Caching [J].
Bidokhti, Shirin Saeedi ;
Wigger, Michele ;
Timo, Roy .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (11) :6996-7016
[4]   Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients [J].
Birk, Yitzhak ;
Kol, Tomer .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2825-2830
[5]   Fundamental limits of caching: improved bounds for users with small buffers [J].
Chen, Zhi ;
Fan, Pingyi ;
Ben Letaief, Khaled .
IET COMMUNICATIONS, 2016, 10 (17) :2315-2318
[6]   Optimal Index Codes With Near-Extreme Rates [J].
Dau, Son Hoang ;
Skachek, Vitaly ;
Chee, Yeow Meng .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (03) :1515-1527
[7]   Error Correction for Index Coding With Side Information [J].
Dau, Son Hoang ;
Skachek, Vitaly ;
Chee, Yeow Meng .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (03) :1517-1531
[8]  
Ghosh S, 2018, IEEE INT SYMP INFO, P441, DOI 10.1109/ISIT.2018.8437914
[9]  
Grassl M., 2007, BOUNDS MINIMUM DISTA
[10]   Order-Optimal Rate of Caching and Coded Multicasting With Random Demands [J].
Ji, Mingyue ;
Tulino, Antonia M. ;
Llorca, Jaime ;
Caire, Giuseppe .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (06) :3923-3949