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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We study a $K$-user coded-caching broadcast problem in a joint source-channelcoding framework. The transmitter observes a database of files that are beinggenerated at a certain rate per channel use, and each user has a cache, whichcan store a fixed fraction of the generated symbols. In the delivery phase, thetransmitter broadcasts a message so that the users can decode their desiredfiles using the received signal and their cache content. The communicationbetween the transmitter and the receivers happens over a (deterministic)\textit{time-varying} erasure broadcast channel, and the channel stateinformation is only available to the users. We characterize the maximumachievable source rate for the $2$-user and the degraded $K$-user problems. Weprovide an upper bound for any caching strategy's achievable source rates.Finally, we present a linear programming formulation to show that the upperbound is not a sharp characterization. Closing the gap between the achievablerate and the optimum rate remains open.

Cache-Aided $K$-User Broadcast Channels with State Information at Receivers