Covert Communication With Polynomial Computational Complexity.
Qiaosheng Eric ZhangMayank BakshiSidharth JaggiPublished in: IEEE Trans. Inf. Theory (2020)
Keyphrases
- computational complexity
- communication overhead
- communication systems
- information flow
- np complete
- computationally efficient
- computer networks
- data acquisition
- high computational complexity
- low complexity
- computer systems
- np hard
- special case
- computational efficiency
- rate distortion
- memory requirements
- information exchange
- communication channels
- lower bound