Covert Communication With Polynomial Computational Complexity
From MaRDI portal
Publication:5123791
DOI10.1109/TIT.2019.2955987zbMath1446.94069OpenAlexW2990547518MaRDI QIDQ5123791
Mayank Bakshi, Sidharth Jaggi, Qiaosheng Zhang
Publication date: 29 September 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2019.2955987
Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29)
This page was built for publication: Covert Communication With Polynomial Computational Complexity