Two Batch Search With Lie Cost

DOI10.1109/TIT.2009.2013014MaRDI QIDQ4975785zbMATH OpenOpenAlexFDO

Authors Ferdinando Cicalese, Christian Deppe, Ugo Vaccaro, Rudolf Ahlswede

Publication date 8 August 2017

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

Full work available at URL https://doi.org/10.1109/tit.2009.2013014

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Cited in

(4)

• Twenty questions with random error
• On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice
• Two-batch liar games on a general bounded channel
• Perfect strategies for the Ulam-Rényi game with multi-interval questions

This page was built for publication: Two Batch Search With Lie Cost

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