The capacity of the semideterministic relay channel (Corresp.)
From MaRDI portal
Publication:3937284
DOI10.1109/TIT.1982.1056502zbMath0479.94015OpenAlexW2155150064MaRDI QIDQ3937284
No author found.
Publication date: 1982
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1982.1056502
Related Items (2)
Capacity bounds and mapping design for binary symmetric relay channels ⋮ Strong converse theorems for multimessage networks with tight cut-set bound
This page was built for publication: The capacity of the semideterministic relay channel (Corresp.)