On identification capacity of infinite alphabets or continuous-time channels

Authors:
M. V. Burnashev
Affiliations:
Inst. of Inf. Transmission Problems, Acad. of Sci., Moscow
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 2

Watermarking identification codes with related topics on common randomness

General Theory of Information Transfer and Combinatorics
Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder

General Theory of Information Transfer and Combinatorics

Quantified Score

Hi-index	754.84

Visualization

Abstract

Two kinds of channels are considered: (1) discrete-time channel with additive noise, and (2) Poisson and white Gaussian (i.e., continuous-time) channels. For the type (1) channel there are given some sufficient conditions when the Shannon and identification capacities coincide. It is shown that the identification capacity of Poisson and Gaussian channels without bandwidth constraint is infinite. Conversely, for a white Gaussian channel with bandwidth constraint, the identification capacity coincides with the Shannon capacity