Searching with lies under error cost constraints
Discrete Applied Mathematics
Two batch search with lie cost
IEEE Transactions on Information Theory
Hi-index | 0.06 |
We show that, using one-time error-free feedback, it is possible to attain the asymptotic Hamming bound if the number of errors is fixed.