Derives second-order asymptotic converse and matching achievability bounds on average detection delay for covert Bayesian quickest change detection under PFA and ECB constraints, quantifying square-root-order covert sensing gain.
Quickest change detection with controlled sensing,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Covert Bayesian Quickest Change Detection
Derives second-order asymptotic converse and matching achievability bounds on average detection delay for covert Bayesian quickest change detection under PFA and ECB constraints, quantifying square-root-order covert sensing gain.