TY - GEN
T1 - Guessing with a Boolean Helper
AU - Weinberger, Nir
AU - Shayevitz, Ofer
N1 - Publisher Copyright: © 2018 IEEE.
PY - 2018/8/15
Y1 - 2018/8/15
N2 - What is the value of one bit of side information to a guesser? We study this problem in a setup where Alice wishes to guess a uniform binary random vector, and can obtain a single bit of information from Bob, who observes this vector through a binary symmetric channel. Our goal is to charaterize the guessing efficiency, namely the maximal reduction factor in Alice's guessing-time moments obtainable by observing Bob's bit. We provide two lower bounds on the guessing efficiency by analyzing the performance of the Dictator and Majority functions, and two upper bounds via maximum entropy and Fourier-analytic/hypercontractivity arguments.
AB - What is the value of one bit of side information to a guesser? We study this problem in a setup where Alice wishes to guess a uniform binary random vector, and can obtain a single bit of information from Bob, who observes this vector through a binary symmetric channel. Our goal is to charaterize the guessing efficiency, namely the maximal reduction factor in Alice's guessing-time moments obtainable by observing Bob's bit. We provide two lower bounds on the guessing efficiency by analyzing the performance of the Dictator and Majority functions, and two upper bounds via maximum entropy and Fourier-analytic/hypercontractivity arguments.
UR - http://www.scopus.com/inward/record.url?scp=85052487118&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2018.8437636
DO - 10.1109/ISIT.2018.8437636
M3 - منشور من مؤتمر
SN - 9781538647806
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 271
EP - 275
BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018
T2 - 2018 IEEE International Symposium on Information Theory, ISIT 2018
Y2 - 17 June 2018 through 22 June 2018
ER -