Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing - Equipe Channel and source coding solutions for emerging digital communication and storage systems
Communication Dans Un Congrès Année : 2024

Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing

Résumé

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.
Fichier principal
Vignette du fichier
Dupraz_isit24.pdf (566.68 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04682212 , version 1 (30-08-2024)

Identifiants

Citer

Elsa Dupraz, Ismaila Salihou Adamou, Reza Asvadi, Tad Matsumoto. Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing. 2024 IEEE International Symposium on Information Theory (ISIT), Jul 2024, Athens, France. pp.2915-2920, ⟨10.1109/ISIT57864.2024.10619545⟩. ⟨hal-04682212⟩
14 Consultations
9 Téléchargements

Altmetric

Partager

More