A proof of Marton's coding theorem for the discrete memoryless broadcast channel (Corresp.)
From MaRDI portal
Publication:3904499
DOI10.1109/TIT.1981.1056302zbMath0455.94007OpenAlexW2157032401MaRDI QIDQ3904499
No author found.
Publication date: 1981
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1981.1056302
Related Items (4)
Transforming monitoring structures with resilient encoders -- application to repeated games ⋮ The broadcast classical-quantum capacity region of a two-phase bidirectional relaying channel ⋮ Network coding for line networks with broadcast channels ⋮ Second-order converses via reverse hypercontractivity
This page was built for publication: A proof of Marton's coding theorem for the discrete memoryless broadcast channel (Corresp.)