Two Batch Search With Lie Cost

No abstract is available for this paper.

• Publication year

  2009

• Venue

  IEEE Transactions on Information Theory

• Publication date

  2009-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TIT.2009.2013014
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Adventures of a Mathematician

  2019cited by this paper
• Two-batch liar games on a general bounded channel

  2009cited by this paper
• Searching with lies under error cost constraints

  2008cited by this paper
• Coding with Feedback and Searching with Lies

  2007cited by this paper
• General Theory of Information Transfer and Combinatorics (Lecture Notes in Computer Science)

  2007cited by this paper
• General Theory of Information Transfer and Combinatorics

  2006cited by this paper
• Non-binary error correcting codes with noiseless feedback, localized errors, or both

  2006cited by this paper
• On q-ary codes correcting all unidirectional errors of a limited magnitude

  2006cited by this paper
• The Two-Batch Liar Game over an Arbitrary Channel

  2005cited by this paper
• The Liar Game Over an Arbitrary Channel

  2005cited by this paper
• Nonbinary Error-Correcting Codes with One-Time Error-Free Feedback

  2005cited by this paper
• Q-Ary Ulam-Rényi Game with Weighted Constrained Lies

  2004cited by this paper
• Searching games with errors - fifty years of coping with liars

  2002cited by this paper
• Least adaptive optimal search with unreliable tests

  2000cited by this paper
• Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound

  2000cited by this paper
• Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness

  1999cited by this paper
• Coping with Errors in Binary Search Procedures

  1980cited by this paper
• Theory of Unidirectional Error Correcting/Detecting Codes

  1978cited by this paper
• Some problems in dissonance theory research on information selectivity.

  1967cited by this paper

• List Decoding Bounds for Binary Codes with Noiseless Feedback

  2024cites this paper
• Binary Error-Correcting Codes With Minimal Noiseless Feedback

  2022cites this paper
• On the Multi-interval Ulam-Rényi game: For 3 Lies 4 Intervals Suffice

  2017cites this paper
• Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions

  2014cites this paper
• Fault-Tolerant Search à la Ulam-Rényi

  2013cites this paper
• Prologue: What This Book Is About

  2013cites this paper
• Bibliography of publications by Rudolf Ahlswede

  2013cites this paper
• Delays and Time Outs

  2013cites this paper
• Adaptive vs. Non-adaptive Search

  2013cites this paper
• A Model for Learning

  2013cites this paper
• Variations on a Theme of Ulam and Rényi: More Types of Questions and Lies

  2013cites this paper
• Weighted Errors over a General Channel

  2013cites this paper
• The Multi-interval Ulam-Rényi Game

  2012cites this paper
• Two-batch liar games on a general bounded channel

  2009cites this paper