On the Subexponential Decay of Detection Error Probabilities in Long Tandems

DOI10.1109/TIT.2008.929032MaRDI QIDQ3604912zbMATH OpenOpenAlexFDO

Authors Wee Peng Tay, Moe Z. Win, John N. Tsitsiklis

Publication date 24 February 2009

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

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13)

Recommendations

• Error Exponents for Neyman–Pearson Detection of Markov Chains in Noise
• Error Exponents for the Detection of Gauss–Markov Signals Using Randomly Spaced Sensors
• Bounds on a Probability for the Heavy Tailed Distribution and the Probability of Deficient Decoding in Sequential Decoding
• On the probability of error in linear multiuser detection
• Error exponents for distributed detection of Markov sources
• Indecomposable error sequences in multiuser detection
• Quantization Effect on the Log-Likelihood Ratio and Its Application to Decentralized Sequential Detection
• Extended binomial moments of a linear code and the undetected error probability
• scientific article; zbMATH DE number 1742116
• Optimal detection of random-length signals

Cited in

(2)

• How fragile are information cascades?
• COUPLED DETECTION RATES: AN INTRODUCTION

This page was built for publication: On the Subexponential Decay of Detection Error Probabilities in Long Tandems

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