Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Guessing Secrets Efficiently via List Decoding (Extended Abstract)
 

Summary: Guessing Secrets Efficiently via List Decoding
(Extended Abstract)
Noga Alon
Venkatesan Guruswami
Tali Kaufman
Madhu Sudan
Abstract
We consider the guessing secrets problem defined by
Chung, Graham, and Leighton [CGL01]. This is a
variant of the standard 20 questions game where the
player has a set of k > 1 secrets from a universe of N
possible secrets. The player is asked Boolean questions
about the secret for each question, the player picks one
of the k secrets adversarially, and answers according to
this secret.
We present an explicit set of O(log N) questions
together with an efficient (i.e., poly(log N) time) algo-
rithm to solve the guessing secrets problem for the case
of 2 secrets. This answers the main algorithmic ques-
tion left unanswered by [CGL01]. The main techniques

  

Source: Alon, Noga - School of Mathematical Sciences, Tel Aviv University
Sudan, Madhu - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

 

Collections: Computer Technologies and Information Sciences; Mathematics