On the asymptotics of M-hypothesis Bayesian detection

DOI10.1109/18.567705MaRDI QIDQ4336306zbMATH OpenOpenAlexFDO

Authors Charles C. Leang, Don H. Johnson

Publication date 12 May 1997

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.567705

zbMATH Keywords

\(M\)-hypothesis Bayesian detection problemasymptotic performanceChernoff distancetwo-hypothesis detection problems

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Recommendations

• scientific article; zbMATH DE number 176080
• Asymptotic analysis of error probabilities for the nonzero-mean Gaussian hypothesis testing problem
• Asymptotically optimal classification for multiple tests with empirically observed statistics
• Some remarks on Bayesian multiple hypothesis testing

Cited in

(12)

• A unified framework for evaluating bounds on the Bayesian cost.
• Bounds on the Bayesian cost in optimum receivers
• Limit theorems for eigenvectors of the normalized Laplacian for random graphs
• Worst- and average-case privacy breaches in randomization mechanisms
• Bayesian <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math> </inline-formula>-Ary Hypothesis Testing: The Meta-Converse and Verdú-Han Bounds Are Tight
• Discriminating quantum states: the multiple Chernoff distance
• Statistical inference on random dot product graphs: a survey
• Multiple objects: error exponents in hypotheses testing and identification
• Some remarks on Bayesian multiple hypothesis testing
• Hypothesis testing, information divergence and computational geometry
• Asymptotic information leakage under one-try attacks
• On the optimal error exponents for classical and quantum antidistinguishability

This page was built for publication: On the asymptotics of M-hypothesis Bayesian detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336306)