Multi-access Coded Caching Scheme with Linear Sub-packetization using PDAs

Sasi, SD and Rajan, BS (2021) Multi-access Coded Caching Scheme with Linear Sub-packetization using PDAs. In: 2021 IEEE International Symposium on Information Theory, ISIT 2021, 12-20 Jul 2021, Melbourne, pp. 861-866.

PDF ISIT_861-866_2021.pdf - Published Version Restricted to Registered users only Download (381kB) | Request a copy

Abstract

In this paper we consider multi-access coded caching problem introduced by Hachem et.al., 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. © 2021 IEEE.

Item Type:	Conference Paper
Publication:	IEEE International Symposium on Information Theory - Proceedings
Publisher:	Institute of Electrical and Electronics Engineers Inc.
Additional Information:	The copyright for this article belongs to Institute of Electrical and Electronics Engineers Inc.
Keywords:	Cache memory, Caching scheme; Coding gains; Multiaccess; Packetization; Problem-based; Specific class; State of the art, Information theory
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	03 Dec 2021 08:40
Last Modified:	03 Dec 2021 08:40
URI:	http://eprints.iisc.ac.in/id/eprint/70258

Actions (login required)

View Item