Error exponent for covert communications over discrete memoryless channels

We define and study the error exponent of covert communications over binary-input Discrete Memoryless Channels (DMCs). Our main result consists of upper and lower bounds for the exponent, which match in a regime that we explicitly characterize. While our proofs follow standard techniques, the vanishing rate regime inherent to covert communications and the… CONTINUE READING

1 Figure or Table