Stealth Communication with Vanishing Power over Binary Symmetric Channels
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.
Book / Congress title:
International Symposium on Information Theory (ISIT)