Guessing with a Boolean Helper

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
Number of pages5
StatePublished - 15 Aug 2018
Event2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
Duration: 17 Jun 201822 Jun 2018

Publication series

NameIEEE International Symposium on Information Theory - Proceedings


Conference2018 IEEE International Symposium on Information Theory, ISIT 2018
Country/TerritoryUnited States

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Guessing with a Boolean Helper'. Together they form a unique fingerprint.

Cite this