For partially-connected DMCs the achievable Stein exponent under covertness equals the non-covert exponent with sublinear noise-free bits; for fully-connected DMCs an achievable exponent improving on local testing is proposed.
On the optimality of binning for distributed hypothesis testing,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SP 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributed Hypothesis Testing Under A Covertness Constraint
For partially-connected DMCs the achievable Stein exponent under covertness equals the non-covert exponent with sublinear noise-free bits; for fully-connected DMCs an achievable exponent improving on local testing is proposed.