New converses in the theory of identification via channels

Author

Steinberg, Yossef

Author_Institution

Dept. of Electr. Eng., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel

fYear

1998

fDate

16-21 Aug 1998

Firstpage

187

Abstract

New converses for identification via arbitrary finite alphabet single-user and multiple-access channels, with finite first- and second-type probabilities of error, are presented. For the arbitrary single-user channel, it is shown that (λ₁, λ ₂)-identification capacity is upper bounded by λ-capacity, for any λ>λ₁+λ₂. An outer bound on the (λ₁, λ₂)-identification capacity region of an arbitrary multiple-access channel is developed. A consequence of this bound is that the identification capacity region is equal to the transmission capacity region for any stationary, finite-memory multiple-access channel

Keywords

error statistics; identification; multi-access systems; multiuser channels; error probabilities; finite alphabet multiple-access channels; finite alphabet single-user channel; identification; identification capacity; outer bound; stationary finite-memory multiple-access channel; transmission capacity region; upper bound; Capacity planning; Channel capacity; Probability; Time sharing computer systems; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on

Conference_Location

Cambridge, MA

Print_ISBN

0-7803-5000-6

Type

conf

DOI

10.1109/ISIT.1998.708785

Filename

708785