All Dates/Times are Australian Eastern Standard Time (AEST)

Technical Program

Paper Detail

Paper IDD2-S6-T1.3
Paper Title Multi-access Coded Caching Scheme with Linear Sub-packetization using PDAs
Authors Shanuja Sasi, B. Sundar Rajan, Indian Institute of Science, India
Session D2-S6-T1: Multi-Access Coded Caching
Chaired Session: Tuesday, 13 July, 23:40 - 00:00
Engagement Session: Wednesday, 14 July, 00:00 - 00:20
Abstract In this paper we consider multi-access coded caching problem introduced by Hachem, where each user has access to $L$ neighboring caches in a cyclic wrap-around fashion. We focus on the deterministic schemes for a specific class of multi-access coded caching problem based on the concept of PDA. We construct new PDAs which specify the delivery scheme for the specific class of multi-access coded caching problem discussed in this paper. For the proposed scheme, the coding gain is larger than that of the state-of-the-art while the sub-packetization level varies only linearly with the number of users. Hence, the advantage of the proposed scheme is two-fold, in terms of the coding gain as well as the sub-packetization level.