Noisy Guesses

DOI10.1109/TIT.2020.2974845zbMATH Open1446.94063arXiv1910.00215MaRDI QIDQ5124464

Neri Merhav

Publication date: 29 September 2020

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

Abstract: We consider the problem of guessing a random, finite-alphabet, secret $n$-vector, where the guesses are transmitted via a noisy channel. We provide a single-letter formula for the best achievable exponential growth rate of the $ho$--th moment of the number of guesses, as a function of $n$. This formula exhibits a fairly clear insight concerning the penalty due to the noise. We describe two different randomized schemes that achieve the optimal guessing exponent. One of them is fully universal in the sense of being independent of source (that governs the vector to be guessed), the channel (that corrupts the guesses), and the moment power $ho$. Interestingly, it turns out that, in general, the optimal guessing exponent function exhibits a phase transition when it is examined either as a function of the channel parameters, or as a function of $ho$: as long as the channel is not too distant (in a certain sense to be defined precisely) from the identity channel (i.e., the clean channel), or equivalently, as long $ho$ is larger than a certain critical value, $h{o}_{mboxinyc}$, there is no penalty at all in the guessing exponent, compared to the case of noiseless guessing.

Full work available at URL: https://arxiv.org/abs/1910.00215

zbMATH Keywords

noisy channelguessing a random finite-alphabet secret \(n\)-vector

Mathematics Subject Classification ID

Sequential statistical methods (62L99) Statistical aspects of information-theoretic topics (62B10) Sampling theory in information and communication theory (94A20) Source coding (94A29)

This page was built for publication: Noisy Guesses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124464)