On identification capacity of infinite alphabets or continuous-time channels

DOI10.1109/18.887853zbMath1003.94019OpenAlexW2127082964MaRDI QIDQ2705974

Marat V. Burnashev

Publication date: 19 March 2001

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.887853

zbMATH Keywords

bandwidthdiscrete-time channelShannon capacityGaussian channelscoding theoremPoisson channelsidentification capacity

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)

This page was built for publication: On identification capacity of infinite alphabets or continuous-time channels