Multi-Access Coded Caching with Coded Placement

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.