Soft Covering Through the Lens of Hypothesis Testing
Abstract: We study the soft covering phenomenon through the lens of Neyman--Pearson hypothesis testing: given a channel output sequence , can one decide whether it was produced when the channel was driven by a random codeword, or generated independently from the output marginal? We derive exact exponential decay rates for the jointly averaged false-alarm (FA) probability and missed-detection (MD) probability , as functions of the decision threshold and the codebook rate . The derived single-letter formulas of the exponents $\EFA(τ,R)=-\lim</em>{n\to\infty}\frac{1}{n}\lnα<em>n(τ,R)$ and $\EMD(τ,R)=-\lim</em>{n\to\infty}\frac{1}{n}\lnβ<em>n(τ,R)$ are tight in the random coding sense. The analysis reveals a rich phase structure. For $R < I(X;Y)$, there is a genuine exponential tradeoff between the two error types over the interval . At , this tradeoff interval collapses to the single point , where both error exponents simultaneously vanish, a fact which manifests the soft covering phenomenon in the Neyman--Pearson sense. For $R > I(X;Y)$, the same instantaneous collapse persists at ; moreover, for every at least one exponent is zero: the FA exponent is zero for (FA probability does not decay exponentially), and the MD exponent is zero for (and finite, channel-specific for $τ<0$; see Remark~\ref{rem:jump}). There is no interval of where both exponents are simultaneously positive. A sharp phase transition in the MD exponent occurs at for all rates.
Paper Prompts
Sign up for free to create and run prompts on this paper.