|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
https://hdl.handle.net/10119/20306
|
| Title: | Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing |
| Authors: | Adamou, Ismaila Salihou
Dupraz, Elsa
Asvadi, Reza
Matsumoto, Tadashi |
| Keywords: | Distributed Hypothesis Testing
short-length codes
binary quantization
quantize-binning scheme
linear block codes
Neyman-Pearson |
| Issue Date: | 2026-02-13 |
| Publisher: | Institute of Electrical and Electronics Engineers (IEEE) |
| Magazine name: | IEEE Transactions on Communications |
| Start page: | 1 |
| End page: | 1 |
| DOI: | 10.1109/TCOMM.2026.3664684 |
| Abstract: | This paper addresses the design of practical shortlength coding schemes for Distributed Hypothesis Testing (DHT). While most prior work on DHT has focused on informationtheoretic analyses—deriving bounds on Type-II error exponents via achievability schemes based on quantization and quantizebinning—the practical implementation of DHT coding schemes has remained largely unexplored. Moreover, existing practical coding solutions for quantization and quantize-binning approaches were developed for source reconstruction tasks considering very long code lengths, and they are not directly applicable to DHT. In this context, this paper introduces efficient shortlength implementations of quantization and quantize-binning schemes for DHT, constructed from short binary linear block codes. Numerical results show the efficiency of the proposed coding schemes compared to uncoded cases and to existing schemes initially developed for data reconstruction. In addition to practical code design, the paper derives exact analytical expressions for the Type-I and Type-II error probabilities associated with each proposed scheme. The provided analytical expressions are shown to predict accurately the practical performance measured from Monte Carlo simulations of the proposed schemes. These theoretical results are novel and offer a useful framework for optimizing and comparing practical DHT schemes across a wide range of source and code parameters. |
| Rights: | This is the author's version of the work. Copyright (C) 2026 IEEE. IEEE Transactions on Communications (Early Access). DOI: https://doi.org/10.1109/TCOMM.2026.3664684. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
| URI: | https://hdl.handle.net/10119/20306 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| I-MATSUMOTO-T-0208.pdf | | 834Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
