A coding theorem for the discrete memoryless broadcast channel

DOI10.1109/TIT.1979.1056046MaRDI QIDQ4186211zbMATH OpenFDO

Authors K. Marton

Publication date 1979

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1979.1056046

zbMATH Keywords

Coding TheoremDiscrete Memoryless Broadcast Channel

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Cited in

(6)

• Hadamard quantum broadcast channels
• On the near-optimality of one-shot classical communication over quantum channels
• Identification over quantum broadcast channels
• Quantum broadcast channel simulation via multipartite convex splitting
• Three-receiver quantum broadcast channels: classical communication with quantum non-unique decoding
• The broadcast classical-quantum capacity region of a two-phase bidirectional relaying channel

This page was built for publication: A coding theorem for the discrete memoryless broadcast channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4186211)