vix.ing · top · new · best · stats · spec

Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing

2024/05/13 by Elsa Dupraz, Dupraz, Elsa, Ismaila Salihou Adamou +5
Computer Science · Engineering · #Distributed Sensor Networks and Detection Algorithms #Energy Efficient Wireless Sensor Networks #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Body Area Networks

paper · doi:10.48550/arxiv.2405.07697

openalex publication_date 2024/05/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Abstract

This paper investigates practical coding schemes for Distributed Hypothesis Testing (DHT). While the literature has extensively analyzed the information-theoretic performance of DHT and established bounds on Type-II error exponents through quantize and quantize-binning achievability schemes, the practical implementation of DHT coding schemes has not yet been investigated. Therefore, this paper introduces practical implementations of quantizers and quantize-binning schemes for DHT, leveraging short-length binary linear block codes. Furthermore, it provides exact analytical expressions for Type-I and Type-II error probabilities associated with each proposed coding scheme. Numerical results show the accuracy of the proposed analytical error probability expressions, and enable to compare the performance of the proposed schemes.

Related