An Improved Lower Bound for Multi-Access Coded Caching

Krishnan Namboodiri, KK and Sundar Rajan, B (2022) An Improved Lower Bound for Multi-Access Coded Caching. In: 2022 IEEE International Symposium on Information Theory, ISIT 2022, 26 June 2022 through 1 July 2022, Espoo, pp. 1713-1718.

PDF IEEE-ISIT 2022_2022_1713_1718_2022.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

The multi-access variant of the coded caching problem with N files, K users and K caches, where each user has access to L neighbouring caches in a cyclic wrap-around manner, is considered. A cut-set based lower bound on the optimal rate-memory trade-off of the multi-access coded caching (MACC) scheme is derived. Furthermore, an improved lower bound on the optimal rate-memory trade-off of the MACC scheme is derived using non-cut-set arguments. The improved lower bound is tighter than the previously known lower bounds for the same setting.

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; Cut sets; Low bound; Multiaccess; Optimal rate; Trade off, Economic and social effects
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	15 Sep 2022 05:25
Last Modified:	15 Sep 2022 05:25
URI:	https://eprints.iisc.ac.in/id/eprint/76465

Actions (login required)

View Item