Cyclic Wrap-around Multi-Access Coded Caching with Private Caches

We study a variant of the coded caching problem where a server, with a library of files, serves users through a broadcast link. Each user is equipped with a private cache and additionally connects to L neighboring access caches in a cyclic wrap-around manner. This setting generalizes the cyclic wraparound networks studied in coded caching by incorporating private caches. For this model, we propose a coded caching scheme under uncoded placement, characterize its achievable rate, and derive a cut-set-based lower bound on the optimal worst-case rate. The optimality of the scheme is proven in the large-memory regime and verified through numerical comparisons.