Error exponents for distributed detection of Markov sources
From MaRDI portal
binary hypothesis testingblowing-up lemmadiscrete-time finite-valued stationary ergodic Markov sourcedistributed detectionerror exponentinfinite-dimensional distributionsinformational divergence rateNeyman- Pearson central detectorsufficient statisticstype II error rateuniversally optimal sequence of acceptance regions
Recommendations
- Error Exponents for the Detection of Gauss–Markov Signals Using Randomly Spaced Sensors
- Error Exponents for Neyman–Pearson Detection of Markov Chains in Noise
- Error bounds for parallel distributed detection under the Neyman-Pearson criterion
- Error exponents for decentralized detection in tree networks
- Distributed weak signal detection and asymptotic relative efficiency in dependent noise
- scientific article; zbMATH DE number 4009475
- An information theoretic approach to the distributed detection problem
- A note on the asymptotics of distributed detection with feedback
- Optimal detection of discrete Markov sources over discrete memoryless channels-applications to combined source-channel coding
- Detection of binary Markov sources over channels with additive Markov noise
Cited in
(6)- Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration
- On Error Exponents in Hypothesis Testing
- On the Subexponential Decay of Detection Error Probabilities in Long Tandems
- A note on the asymptotics of distributed detection with feedback
- Divergence-Based Soft Decision for Error Resilient Decentralized Signal Detection
- Multiterminal Statistical Inference: An Unsolved Problem
This page was built for publication: Error exponents for distributed detection of Markov sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4308774)