Searching with lies under error cost constraints-Reference-Cited by-同舟云学术

Searching with lies under error cost constraints

Published:2008-05 Issue:9 Volume:156 Page:1444-1460
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Ahlswede Rudolf,Cicalese Ferdinando,Deppe Christian

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference13 articles.

1. Nonbinary error-correcting codes with one-time error-free feedback;Bassalygo;Problems Inform. Transmission,2005

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

3. Quasi-perfect minimally adaptive q-ary search with unreliable tests;Cicalese,2003

4. Q-ary Ulam–Rényi game with constrained lies;Cicalese,2006

5. F. Cicalese, C. Deppe, D. Mundici, Q-ary Ulam–Rényi game with weighted constrained lies, in: Proceedings of the 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, Lecture Notes in Computer Science, vol. 3106, Springer, Berlin, 2004, pp. 127–132.

Cited by 14 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. Minimum number of queries for an adaptive liar search game with small sets;Discrete Optimization;2013-11

4. A Model for Learning;Fault-Tolerant Search Algorithms;2013

5. Group Testing;Fault-Tolerant Search Algorithms;2013