Covering Codes as Near-Optimal Quantizers for Distributed Testing Against Independence
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909358729723904 |
|---|---|
| author | Khaledian, Fatemeh Asvadi, Reza Dupraz, Elsa Matsumoto, Tad |
| author_facet | Khaledian, Fatemeh Asvadi, Reza Dupraz, Elsa Matsumoto, Tad |
| contents | We explore the problem of distributed Hypothesis Testing (DHT) against independence, focusing specifically on Binary Symmetric Sources (BSS). Our investigation aims to characterize the optimal quantizer among binary linear codes, with the objective of identifying optimal error probabilities under the Neyman-Pearson (NP) criterion for short code-length regime. We define optimality as the direct minimization of analytical expressions of error probabilities using an alternating optimization (AO) algorithm. Additionally, we provide lower and upper bounds on error probabilities, leading to the derivation of error exponents applicable to large code-length regime. Numerical results are presented to demonstrate that, with the proposed algorithm, binary linear codes with an optimal covering radius perform near-optimally for the independence test in DHT. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_15839 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Covering Codes as Near-Optimal Quantizers for Distributed Testing Against Independence Khaledian, Fatemeh Asvadi, Reza Dupraz, Elsa Matsumoto, Tad Information Theory We explore the problem of distributed Hypothesis Testing (DHT) against independence, focusing specifically on Binary Symmetric Sources (BSS). Our investigation aims to characterize the optimal quantizer among binary linear codes, with the objective of identifying optimal error probabilities under the Neyman-Pearson (NP) criterion for short code-length regime. We define optimality as the direct minimization of analytical expressions of error probabilities using an alternating optimization (AO) algorithm. Additionally, we provide lower and upper bounds on error probabilities, leading to the derivation of error exponents applicable to large code-length regime. Numerical results are presented to demonstrate that, with the proposed algorithm, binary linear codes with an optimal covering radius perform near-optimally for the independence test in DHT. |
| title | Covering Codes as Near-Optimal Quantizers for Distributed Testing Against Independence |
| topic | Information Theory |
| url | https://arxiv.org/abs/2410.15839 |