Perfect Two-Fault Tolerant Search with Minimum Adaptiveness-Reference-Cited by-同舟云学术

Perfect Two-Fault Tolerant Search with Minimum Adaptiveness

Published:2000-07 Issue:1 Volume:25 Page:65-101
ISSN:0196-8858
Container-title:Advances in Applied Mathematics
language:en
Short-container-title:Advances in Applied Mathematics

Author:

Cicalese Ferdinando,Mundici Daniele

Publisher

Elsevier BV

Subject

Applied Mathematics

Reference23 articles.

1. Searching with lies;Aigner;J. Combin. Theory Ser. A,1995

2. R. S. Borgstrom and S. Rao, Kosaraju, Comparison-based search in the presence of errors, inProceedings of the 25th Annual ACM Symposium on the Theory of Computing, San Diego, California, 16–18 May 1993, pp. 130–136.

3. Block coding for the binary symmetric channel with noiseless, delayless feedback;Berlekamp,1968

4. Further results in the construction of mutually orthogonal Latin squares and the falsity of a conjecture of Euler;Bose;Canad. J. Math.,1960

5. A new table of constant weight codes;Brouwer;IEEE Trans. Inform. Theory,1990

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Correcting errors in asymmetric and generalized asymmetric channels with feedback;2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY);2023-10-24

2. Correcting One Error in Non-Binary Channels with Feedback;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

3. Exact learning from an honest teacher that answers membership queries;Theoretical Computer Science;2018-07

4. Minimum number of queries for an adaptive liar search game with small sets;Discrete Optimization;2013-11

5. Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions;Theory of Computing Systems;2013-06-27