2018/01/11 by Nir Weinberger, Weinberger, Nir, Yuval Kochman +1
Computer Science · Engineering · #Distributed Sensor Networks and Detection Algorithms #FOS: Computer and information sciences #Information Theory (cs.IT) #Security in Wireless Sensor Networks #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1801.03687
openalex publication_date 2018/01/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The distributed hypothesis testing problem with full side-information is\nstudied. The trade-off (reliability function) between the two types of error\nexponents under limited rate is studied in the following way. First, the\nproblem is reduced to the problem of determining the reliability function of\nchannel codes designed for detection (in analogy to a similar result which\nconnects the reliability function of distributed lossless compression and\nordinary channel codes). Second, a single-letter random-coding bound based on a\nhierarchical ensemble, as well as a single-letter expurgated bound, are derived\nfor the reliability of channel-detection codes. Both bounds are derived for a\nsystem which employs the optimal detection rule. We conjecture that the\nresulting random-coding bound is ensemble-tight, and consequently optimal\nwithin the class of quantization-and-binning schemes.\n