An Upper Bound on the Capacity of the Causal Dirty-Paper Channel

DOI10.1109/TIT.2011.2162261zbMath1365.94293OpenAlexW2165167226MaRDI QIDQ5272345

Mustafa Kesal, Uri Erez

Publication date: 12 July 2017

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

Full work available at URL: https://doi.org/10.1109/tit.2011.2162261

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)

This page was built for publication: An Upper Bound on the Capacity of the Causal Dirty-Paper Channel