Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
From MaRDI portal
Publication:1586758
DOI10.1016/S0012-365X(00)00109-6zbMath0967.91008OpenAlexW2007047164WikidataQ127202712 ScholiaQ127202712MaRDI QIDQ1586758
Publication date: 29 August 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00109-6
Related Items (12)
Coding with noiseless feedback ⋮ Strategies for the Renyi--Ulam game with fixed number of lies ⋮ \(Q\)-ary search with one Lie and bi-interval queries ⋮ \(Q\)-ary Rényi-Ulam pathological liar game with one lie ⋮ Correcting a single error in feedback channels ⋮ Perfect minimally adaptive \(q\)-ary search with unreliable tests ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies ⋮ Minimum number of queries for an adaptive liar search game with small sets ⋮ Searching for a counterfeit coin with two unreliable weighings ⋮ The Rényi-Ulam pathological liar game with a fixed number of lies ⋮ Search with noisy and delayed response
This page was built for publication: Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes
