Name
Abstract | ||
|---|---|---|
Given a code used to send a message to two receivers through a degraded discrete memoryless broadcast channel (DM-BC), the sender wishes to alter the codewords to achieve the following goals: (i) the original broadcast communication continues to take place, possibly at the expense of a tolerable increase of the decoding error probability; and (ii) an additional covert message can be transmitted to the stronger receiver such that the weaker receiver cannot detect the existence of this message. The main results are: (a) feasibility of covert communications is proven by using a random coding argument for general DM-BCs; and (b) necessary conditions for establishing covert communications are described and an impossibility (converse) result is presented for a particular class of DM-BCs. Together, these results characterize the asymptotic fundamental limits of covert communications for this particular class of DM-BCs within an arbitrarily small gap. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ISIT.2019.8849435 | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
Keywords | DocType | Citations |
Covert Communication, Low Probability of Detection, Information-Theoretic Security, Broadcast Channel | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Kibloff | 1 | 0 | 0.68 |
| Samir Medina Perlaza | 2 | 722 | 48.69 |
| Ligong Wang | 3 | 0 | 0.34 |