English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This work considers the combinatorial multi-access coded caching problemintroduced in the recent work by Muralidhar \textit{et al.} [P. N. Muralidhar,D. Katyal, and B. S. Rajan, ``Maddah-Ali-Niesen scheme for multi-access codedcaching,'' in \textit{IEEE Inf. Theory Workshop (ITW)}, 2021] The problemsetting consists of a central server having a library of $N$ files and $C$caches each with capacity $M$. Each user in the system can access a unique setof $r<C$ caches, and there exist users corresponding to every distinct set of$r$ caches. Therefore, the number of users in the system is $\binom{C}{r}$. Forthe aforementioned combinatorial multi-access setting, we propose a codedcaching scheme with an MDS code-based coded placement. This novel placementtechnique helps to achieve a better rate in the delivery phase compared to theoptimal scheme under uncoded placement when $M> N/C$. For a lower memoryregime, we present another scheme with coded placement, which outperforms theoptimal scheme under uncoded placement if the number of files is no more thanthe number of users. Further, we derive an information-theoretic lower bound onthe optimal rate-memory trade-off of the combinatorial multi-access codedcaching scheme. In addition, using the derived lower bound, we show that thefirst scheme is optimal in the higher memory regime, and the second scheme isoptimal if $N\leq \binom{C}{r}$. Finally, we show that the performance of thefirst scheme is within a constant factor of the optimal performance, when$r=2$.

Combinatorial Multi-Access Coded Caching: Improved Rate-Memory Trade-off with Coded Placement