6 problems

Covertness-metric conjecture. For sub-exponential random slot selection, the choice of covertness metric has no impact on the covert-capacity result.

Achievability-refinement conjecture. The relative-entropy bound used in the achievability proof can be refined so as to recover the desired factor of $\sqrt{2}$.

Tightness conjecture. The converse bound is tight and therefore equals the covert capacity.

Capacity-bound conjecture. The upper bound on the covert capacity obtained in this work is the correct covert capacity.

Let $C_{\mathrm{no-CSI}}(\delta)$ denote the covert capacity of the non-coherent fast Rayleigh-fading channel, and let an input distribution be represented by its mass points, with…

Consider a non-coherent fast Rayleigh-fading channel with an amplitude-constrained input distribution, where the input distribution is discrete and has one mass point at zero. Two-…