Guessing Based on Compressed Side Information

DOI10.1109/TIT.2022.3158475MaRDI QIDQ5088549zbMATH OpenOpenAlexFDO

Authors Robert Graczyk, Amos Lapidoth, Neri Merhav, Christoph Pfister

Publication date 13 July 2022

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

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

zbMATH Keywords

indirect-rate-distortion

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24) Rate-distortion theory in information and communication theory (94A34)

Abstract: A source sequence is to be guessed with some fidelity based on a rate-limited description of an observed sequence with which it is correlated. The trade-off between the description rate and the exponential growth rate of the least power mean of the number of guesses is characterized.

Cited in

(1)

• New mathematical techniques in information theory. Abstracts from the workshop held March 13--19, 2022

This page was built for publication: Guessing Based on Compressed Side Information

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