Perfect two-fault tolerant search with minimum adaptiveness
type: Item
instance of: scholarly article
title: Perfect two-fault tolerant search with minimum adaptiveness
zbMATH Open document ID: 0965.68014
author: Ferdinando Cicalese
author: Daniele Mundici
published in: Advances in Applied Mathematics
publication date: 2000-11-16T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 05A99
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 1531142
zbMATH Keywords: non-adaptive searching strategies
MaRDI profile type: Publication
full work available at URL: aama.2000.0688
OpenAlex ID: W2064064651
cites work: Searching with lies
cites work: Comparison-based search in the presence of errors
cites work: Q5568914
cites work: Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
cites work: A new table of constant weight codes
cites work: Q4938780
cites work: Optimal strategies against a liar
cites work: Ulam's searching game with lies
cites work: Q4841306
cites work: Q4886068
cites work: Q4146667
cites work: Optimal comparison strategies in Ulam's searching game with two errors
cites work: Ulam's searching game with three lies
cites work: Solution of Ulam's problem on searching with a lie
cites work: Coping with errors in binary search procedures
cites work: Maximum distance&lt;tex&gt;q&lt;/tex&gt;-nary codes
cites work: Ulam's searching game with a fixed number of lies
cites work: On the Nonexistence of Perfect Codes over Finite Fields
cites work: Q4121861
DOI: 10.1006/AAMA.2000.0688
description: scientific article; zbMATH DE number 1531142