Pages that link to "Item:Q1586758"
From MaRDI portal
The following pages link to Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes (Q1586758):
Displayed 12 items.
- \(Q\)-ary Rényi-Ulam pathological liar game with one lie (Q628343) (← links)
- Minimum number of queries for an adaptive liar search game with small sets (Q1799380) (← links)
- Strategies for the Renyi--Ulam game with fixed number of lies (Q1884914) (← links)
- Coding with noiseless feedback (Q2364460) (← links)
- \(Q\)-ary search with one Lie and bi-interval queries (Q2379948) (← links)
- Perfect minimally adaptive \(q\)-ary search with unreliable tests (Q2433824) (← links)
- Searching for a counterfeit coin with two unreliable weighings (Q2565856) (← links)
- The Rényi-Ulam pathological liar game with a fixed number of lies (Q2575810) (← links)
- Search with noisy and delayed response (Q3439235) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies (Q5962511) (← links)
- Correcting a single error in feedback channels (Q6173470) (← links)