Perfect two-fault tolerant search with minimum adaptiveness

DOI10.1006/AAMA.2000.0688zbMath0965.68014OpenAlexW2064064651MaRDI QIDQ1585493

Daniele Mundici, Ferdinando Cicalese

Publication date: 16 November 2000

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aama.2000.0688

zbMATH Keywords

non-adaptive searching strategies

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Enumerative combinatorics (05A99)

Related Items (6)

Exact learning from an honest teacher that answers membership queries ⋮ Perfect strategies for the Ulam-Rényi game with multi-interval questions ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Least adaptive optimal search with unreliable tests ⋮ Minimum number of queries for an adaptive liar search game with small sets ⋮ Searching with lies under error transition cost constraints

Cites Work

• Solution of Ulam's problem on searching with a lie
• Ulam's searching game with lies
• Coping with errors in binary search procedures
• Ulam's searching game with a fixed number of lies
• Optimal comparison strategies in Ulam's searching game with two errors
• Ulam's searching game with three lies
• Searching with lies
• Optimal strategies against a liar
• A new table of constant weight codes
• Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
• Comparison-based search in the presence of errors
• On the Nonexistence of Perfect Codes over Finite Fields
• Maximum distance<tex>q</tex>-nary codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect two-fault tolerant search with minimum adaptiveness