Constructions of Coded Caching Schemes With Flexible Memory Size

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.

Download Full-text

Dynamics of Exploration and Exploitation in Strategic Interactions: A Function of Memory Size on Adaptive Learning in Repeated Zerosum Games

PsycEXTRA Dataset ◽

10.1037/e683332011-013 ◽

2003 ◽

Author(s):

Masanori Takezawa ◽

Yohsuke Ohtsubo

Keyword(s):

Adaptive Learning ◽

Strategic Interactions ◽

Exploration And Exploitation ◽

Memory Size

Download Full-text

One-Sided Secretary Problem with Limited Memory Size Using Cardinal Payoffs

SSRN Electronic Journal ◽

10.2139/ssrn.2804347 ◽

2016 ◽

Author(s):

Tianhao Wu ◽

Qiwei He

Keyword(s):

Secretary Problem ◽

Limited Memory ◽

Memory Size

Download Full-text

A Cooperative Coded Caching Strategy for D2D-Enabled Cellular Networks

2020 IEEE/CIC International Conference on Communications in China (ICCC) ◽

10.1109/iccc49849.2020.9238966 ◽

2020 ◽

Author(s):

Yunpeng Ma ◽

Weijing Qi ◽

Peng Lin ◽

Mengru Wu ◽

Lei Guo

Keyword(s):

Cellular Networks ◽

Caching Strategy ◽

Coded Caching

Download Full-text

Cache-Aided Modulation for Heterogeneous Coded Caching over a Gaussian Broadcast Channel

GLOBECOM 2020 - 2020 IEEE Global Communications Conference ◽

10.1109/globecom42002.2020.9348036 ◽

2020 ◽

Author(s):

Mozhgan Bayat ◽

Kai Wan ◽

Mingyue Ji ◽

Giuseppe Caire

Keyword(s):

Broadcast Channel ◽

Coded Caching

Download Full-text

Full Coded Caching Gains for Cache-Less Users

IEEE Transactions on Information Theory ◽

10.1109/tit.2020.3015348 ◽

2020 ◽

Vol 66 (12) ◽

pp. 7635-7651

Author(s):

Eleftherios Lampiris ◽

Petros Elia

Keyword(s):

Coded Caching

Download Full-text

Cache-Aided General Linear Function Retrieval

Entropy ◽

10.3390/e23010025 ◽

2020 ◽

Vol 23 (1) ◽

pp. 25

Author(s):

Kai Wan ◽

Hua Sun ◽

Mingyue Ji ◽

Daniela Tuninetti ◽

Giuseppe Caire

Keyword(s):

Linear Function ◽

Linear Functions ◽

General Linear ◽

Linear Combinations ◽

Past Work ◽

Single File ◽

Caching Scheme ◽

Retrieval Scheme ◽

Data Points ◽

Coded Caching

Coded Caching, proposed by Maddah-Ali and Niesen (MAN), has the potential to reduce network traffic by pre-storing content in the users’ local memories when the network is underutilized and transmitting coded multicast messages that simultaneously benefit many users at once during peak-hour times. This paper considers the linear function retrieval version of the original coded caching setting, where users are interested in retrieving a number of linear combinations of the data points stored at the server, as opposed to a single file. This extends the scope of the authors’ past work that only considered the class of linear functions that operate element-wise over the files. On observing that the existing cache-aided scalar linear function retrieval scheme does not work in the proposed setting, this paper designs a novel coded caching scheme that outperforms uncoded caching schemes that either use unicast transmissions or let each user recover all files in the library.

Download Full-text