A New Upper Bound for Distributed Hypothesis Testing Using the Auxiliary Receiver Approach

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Wen, Zhenduo, Gohari, Amin
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866913967826272256
author Wen, Zhenduo
Gohari, Amin
author_facet Wen, Zhenduo
Gohari, Amin
contents This paper employs the add-and-subtract technique of the auxiliary receiver approach to establish a new upper bound for the distributed hypothesis testing problem. This new bound has fewer assumptions than the upper bound proposed by Rahman and Wagner, is at least as tight as the bound by Rahman and Wagner, and can outperform it in certain Gaussian settings. Conceptually speaking, unlike Rahman and Wagner, who view their additional receiver as side information, we view it as an auxiliary receiver and use a different manipulation for single-letterization.
format Preprint
id arxiv_https___arxiv_org_abs_2409_14148
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A New Upper Bound for Distributed Hypothesis Testing Using the Auxiliary Receiver Approach
Wen, Zhenduo
Gohari, Amin
Information Theory
This paper employs the add-and-subtract technique of the auxiliary receiver approach to establish a new upper bound for the distributed hypothesis testing problem. This new bound has fewer assumptions than the upper bound proposed by Rahman and Wagner, is at least as tight as the bound by Rahman and Wagner, and can outperform it in certain Gaussian settings. Conceptually speaking, unlike Rahman and Wagner, who view their additional receiver as side information, we view it as an auxiliary receiver and use a different manipulation for single-letterization.
title A New Upper Bound for Distributed Hypothesis Testing Using the Auxiliary Receiver Approach
topic Information Theory
url https://arxiv.org/abs/2409.14148