8 problems

Covert capacity equality conjecture. Equality holds in general in covert communication:

Consider a wireless ad hoc network with a covertness constraint, in which mobile nodes may have trajectories with limited correlation rather than being uniformly and independently…

Let $c_{\rm rel,\chi}=\eta\log\left(1+((1-\eta)\bar{n}_{\rm B})^{-1}\right)$ denote the upper-bound constant for the number of reliably transmissible covert bits over a bosonic cha…

Consider a wireless ad hoc network in which the number of legitimate nodes is not larger than the number of wardens. Preservation regions are regions around wardens used to protect…

Let $u$ denote the change-point time, $theta$ the covertness requirement, and $u$ and $theta$ satisfy the conditions considered for LPD communication under the Shewhart, CUSUM, a…

Covert entropy-change conjecture. Even without employing the scheme described above, the resulting change in the entropy of the bits should be covert, and Alice can still insert…

Let $m$ be the number of friendly nodes, $n$ the number of channel uses, $N_{\mathrm{w}}$ the number of Willies, and let $\gamma>2$. Under the strategy in which nodes sufficiently…

Let $m$ be the number of friendly nodes, $n$ the number of channel uses, and let $\gamma>2$. Friendly nodes at distance less than $\iota>0$ from Bob are turned off, while every oth…