Maddah-Ali-Niesen Scheme for Multi-access Coded Caching

被引:16
作者
Muralidhar, Pooja Nayak [1 ]
Katyal, Digvijay [1 ]
Rajan, B. Sundar [1 ]
机构
[1] Indian Inst Sci, Dept Elect Commun Engn, Bengaluru 560012, Karnataka, India
来源
2021 IEEE INFORMATION THEORY WORKSHOP (ITW) | 2021年
关键词
D O I
10.1109/ITW48936.2021.9611394
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The well known Maddah-Ali-Niesen (MAN) coded caching scheme for users with dedicated cache is extended for use in multi-access coded cache scheme where the number of users need not be same as the number of caches in the system. The well known MAN scheme is recoverable as a special case of the multi-access system considered. The performance of this scheme is compared with the existing works on multi-access coded caching. To be able to compare the performance of different multi-access schemes with different number of users for the same number of caches, the terminology of per user rate (rate divided by the number of users) introduced in [11] is used.
引用
收藏
页数:6
相关论文
共 13 条
[1]  
Agrawal S, 2019, IEEE INT SYMP INFO, P1227, DOI [10.1109/isit.2019.8849338, 10.1109/ISIT.2019.8849338]
[2]  
Cheng M., ARXIV201204483V2
[3]   Coded Caching for Multi-level Popularity and Access [J].
Hachem, Jad ;
Karamchandani, Nikhil ;
Diggavi, Suhas N. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (05) :3108-3141
[4]   Multi-Access Coded Caching Schemes From Cross Resolvable Designs [J].
Katyal, Digvijay ;
Muralidhar, Pooja Nayak ;
Rajan, B. Sundar .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2021, 69 (05) :2997-3010
[5]  
Krishnan P, 2018, INFO THEOR WORKSH, P175
[6]   Fundamental Limits of Caching [J].
Maddah-Ali, Mohammad Ali ;
Niesen, Urs .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (05) :2856-2867
[7]  
Muralidhar P. N., ARXIV210108723V3 CSI
[8]   Rate-Memory Trade-off for Multi-Access Coded Caching With Uncoded Placement [J].
Reddy, Kota Srinivas ;
Karamchandani, Nikhil .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (06) :3261-3274
[9]  
Reddy KS, 2019, IEEE INT SYMP INFO, P1232, DOI [10.1109/tcomm.2020.2980817, 10.1109/ISIT.2019.8849829]
[10]  
Reddy KS, 2018, INT CO SIG PROC COMM, P1, DOI 10.1109/SPCOM.2018.8724457