Searching with lies

DOI10.1006/jcta.1996.0036zbMath0846.90149MaRDI QIDQ1913996

Martin Aigner

Publication date: 9 July 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1996.0036

zbMATH Keywords

\(q\)-ary search process; 1-error correcting codes

Mathematics Subject Classification ID

68P10: Searching and sorting

91A46: Combinatorial games

Related Items

Searching games with errors -- fifty years of coping with liars, Least adaptive optimal search with unreliable tests, Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies, On error correction with errors in both the channel and syndrome, Minimum average-case queries of \(q+1\)-ary search game with small sets, \(Q\)-ary Rényi-Ulam pathological liar game with one lie, Pooling designs associated with unitary space and ratio efficiency comparison, Perfect two-fault tolerant search with minimum adaptiveness, An improved heuristic for the ``Ulam-Rényi game, Minimum number of queries for an adaptive liar search game with small sets, Optimal strategies against a liar, Coding with noiseless feedback, \(Q\)-ary search with one Lie and bi-interval queries, On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design, Perfect minimally adaptive \(q\)-ary search with unreliable tests