This article is cited in 7 papers

Authentication, Identification, and Pairwise Separated Measures

L. A. Bassalygo, M. V. Burnashev


Abstract: A certain equivalence of authentication and identification problems is shown. A new upper bound on the maximum number of pairwise-separated in $L_1$-metrics probability measures on a finite alphabet is obtained, which is at the same time an upper bound for those problems.

UDC: 621.391.15

 English version: Problems of Information Transmission, 1996, 32:1, 33–39

Bibliographic databases:

• 
•