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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We consider the    \(K\geq 2\)   -user memoryless Gaussian broadcast channel (BC) with feedback and common message only. We show that linear-feedback schemes with a message point, in the spirit of Schalkwijk and Kailath&#x2019;s scheme for point-to-point channels or Ozarow and Leung&#x2019;s scheme for BCs with private messages, are strictly suboptimal for this setup. Even with perfect feedback, the largest rate achieved by these schemes is strictly smaller than capacity    \(C\)    (which is the same with and without feedback). In the extreme case where the number of receivers    \(K\to \infty \)   , the largest rate achieved by linear-feedback schemes with a message point tends to 0. To contrast this negative result, we describe a scheme for rate-limited feedback that uses the feedback in an intermittent way, i.e., the receivers send feedback signals only in few channel uses. This scheme achieves all rates    \(R\)    up to capacity    \(C\)    with an    \(L\)   th order exponential decay of the probability of error if the feedback rate    \(R_{\text {fb}}\)    is at least    \((L-1)R\)    for some positive integer    \(L\)   .

Insufficiency of Linear-Feedback Schemes in Gaussian Broadcast Channels With Common Message