Stealth Communication with Vanishing Power over Binary Symmetric Channels

05/13/2020
by   Diego Lentner, et al.
0

A framework for stealth communication with vanishing power (VP) is presented by studying binary symmetric channels. Coding theorems are proved by modifying Gallager's error exponents for VP and by applying resolvability exponents. The analysis unifies and generalizes existing rate bounds for covert and stealth communication.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset