Binary Search with Errors and Variable Cost Queries

@article{Sereno1998BinarySW,
  title={Binary Search with Errors and Variable Cost Queries},
  author={Matteo Sereno},
  journal={Inf. Process. Lett.},
  year={1998},
  volume={68},
  pages={261-270}
}
We consider the problem of identifying an unknown value x ∈ {1,2, . . . , n} by asking “Yes–No” questions about x. The goal is to minimize the number of questions required in the worst case, taking into account that no more than B questions may receive answer “Yes” and no more than E answers may be erroneous. We consider two versions of this problem: the discr te and thecontinuousversion. In the discrete case x is a member of the finite set {1,2, . . . , n}; in the continuous case x is a member… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Block coding for the binary symmetric channel with noiseless, delayless feedback, in: Error-Correcting Codes

  • E. R. Berlekamp
  • 1968
Highly Influential
4 Excerpts

Binary search with errors and variable cost queries

  • M. Sereno
  • Technical Report,
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…