RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2020 Volume 56, Issue 2, Pages 64–81 (Mi ppi2316)

This article is cited in 3 papers

Information Theory

New upper bounds in the hypothesis testing problem with information constraints

M. V. Burnashev

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

Abstract: We consider a hypothesis testing problem where a part of data cannot be observed. Our helper observes the missed data and can send us a limited amount of information about them. What kind of this limited information will allow us to make the best statistical inference? In particular, what is the minimum information sufficient to obtain the same results as if we directly observed all the data? We derive estimates for this minimum information and some other similar results.

Keywords: hypothesis testing, information constraints, error probabilities.

UDC: 621.391.1 : 519.2

Received: 10.04.2020
Revised: 15.05.2020
Accepted: 19.05.2020

DOI: 10.31857/S0555292320020023


 English version:
Problems of Information Transmission, 2020, 56:2, 157–172

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025