"Covert Communication With Polynomial Computational Complexity."

Qiaosheng Eric Zhang, Mayank Bakshi, Sidharth Jaggi (2020)

> Home

Details and statistics

DOI: 10.1109/TIT.2019.2955987

access: closed

type: Journal Article

metadata version: 2020-03-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/ZhangBJ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/ZhangBJ20
Qiaosheng Eric Zhang, Mayank Bakshi, Sidharth Jaggi:
Covert Communication With Polynomial Computational Complexity. IEEE Trans. Inf. Theory 66(3): 1354-1384 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.