DocumentCode
3636355
Title
On iterated logarithm solutions to identification protocols
Author
Hervé Chabanne;Gérard Cohen;Bruno Kindarji
Author_Institution
Institut Té
fYear
2010
Firstpage
1
Lastpage
5
Abstract
We show in this paper that when some constraints are relaxed in the League Problem, we can obtain a communicating scheme in 1 + ⌈log log log n⌉ bits exchanged where n is the number of teams involved in the league. This contrasts with previous results due mainly to Ortlitsky. The price we have to pay is that, with a vanishing error probability, a wrong decision is made. We also give some extensions and applications to our setting.
Keywords
"Protocols","Testing","Frequency","Total harmonic distortion","Signal to noise ratio","Harmonic distortion","Dynamic range","Noise level","Signal analysis","Equations"
Publisher
ieee
Conference_Titel
Information Theory (ITW 2010, Cairo), 2010 IEEE Information Theory Workshop on
Print_ISBN
978-1-4244-6372-5
Type
conf
DOI
10.1109/ITWKSPS.2010.5503130
Filename
5503130
Link To Document