On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback
From MaRDI portal
Publication:2989346
Abstract: A coding scheme for the discrete memoryless broadcast channel with {noiseless, noisy, generalized} feedback is proposed, and the associated achievable region derived. The scheme is based on a block-Markov strategy combining the Marton scheme and a lossy version of the Gray-Wyner scheme with side-information. In each block the transmitter sends fresh data and update information that allows the receivers to improve the channel outputs observed in the previous block. For a generalization of Dueck's broadcast channel our scheme achieves the noiseless-feedback capacity, which is strictly larger than the no-feedback capacity. For a generalization of Blackwell's channel and when the feedback is noiseless our new scheme achieves rate points that are outside the no-feedback capacity region. It follows by a simple continuity argument that for both these channels and when the feedback noise is sufficiently low, our scheme improves on the no-feedback capacity even when the feedback is noisy.
Cited in
(7)- On the Capacity of 1-to-$K$ Broadcast Packet Erasure Channels With Channel Output Feedback
- The feedback capacity region of a class of discrete memoryless multiple access channels (Corresp.)
- The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint
- Feedback does not increase the capacity of discrete channels with additive noise
- A Converse Result for the Discrete Memoryless Relay Channel With Relay–Transmitter Feedback
- Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations
- scientific article; zbMATH DE number 6765476 (Why is no real title available?)
This page was built for publication: On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989346)
