We analyze a two-receiver binary-input discrete memory less broadcast channel, in which the transmitter communicates a common message simultaneously to both receivers and a covert message to only one of them. The unintended recipient of the covert message is treated as an adversary who attempts to detect the covert transmission. This model captures the problem of embedding covert messages in an innocent code book and generalizes previous covert communication models in which innocent behavior corresponds to the absence of communication between legitimate users. We identify the exact asymptotic behavior of the number of covert bits that can be transmitted when the rate of the innocent code book is close to the capacity of the channel to the adversary. Our results also identify the dependence of the number of covert bits on the channel parameters and the characteristics of the innocent code book.
To View the Abstract Contents
Now it is Your Time to Shine.
Great careers Start Here.
We Guide you to Every Step
Success! You're Awesome
Thank you for filling out your information!
We’ve sent you an email with your Final Year Project PPT file download link at the email address you provided. Please enjoy, and let us know if there’s anything else we can help you with.
To know more details Call 900 31 31 555
The WISEN Team