Multi-Access Coded Caching with Coded Placement

Krishnan Namboodiri, KK and Sundar Rajan, B (2022) Multi-Access Coded Caching with Coded Placement. In: IEEE Wireless Communications and Networking Conference, WCNC 2022, 10 April 2022 through 13 April 2022, Austin, pp. 2274-2279.

PDF IEEE_WCNC_2274-2279_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 K users, K caches and N files, where each user has access to L neighbouring caches in a cyclic wrap-around manner, is studied. Coded placement technique is introduced in the multi-access coded caching set-up for the first time. Furthermore, it is shown that the rate of transmission can be significantly lowered using coded placement, especially when the number of files is no more than the number of users. For cache memory M leq frac{N - (K - L)}{K}, a multi-access coded caching scheme with coded placement is introduced. The scheme presented is optimal when N ≤ K. Also, for some specific values of K,L,N and M, achievable schemes and matching converses are presented.

Item Type:	Conference Paper
Publication:	IEEE Wireless Communications and Networking Conference, WCNC
Publisher:	Institute of Electrical and Electronics Engineers Inc.
Additional Information:	The copyright for this article belongs to the Institute of Electrical and Electronics Engineers Inc.
Keywords:	Information theory, Caching scheme; Matchings; Multiaccess; Specific values, Cache memory
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	04 Jul 2022 06:09
Last Modified:	04 Jul 2022 06:09
URI:	https://eprints.iisc.ac.in/id/eprint/74151

Actions (login required)

View Item