×

Coping with errors in binary search procedures. (English) Zbl 0443.68043


MSC:

68P10 Searching and sorting
68Q25 Analysis of algorithms and problem complexity
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Berlekamp, E. R., Block coding for the binary symmetric channel with Noiseless, delayless feedback, (Error-Correcting Codes (1968), Wiley: Wiley New York), 61-85 · Zbl 0176.49404
[2] T. H. Brylawski, The mathematics of Watergate, Unpublished paper.; T. H. Brylawski, The mathematics of Watergate, Unpublished paper.
[3] S. Gal, B. Bacherlis, and A. Ben-Tal, On finding the maximum range of validity of a constrained System, SIAM J. Control Opt., in press.; S. Gal, B. Bacherlis, and A. Ben-Tal, On finding the maximum range of validity of a constrained System, SIAM J. Control Opt., in press.
[4] Katona, G. O.H., Combinatorial search problems, (A Survey of Combinatorial Theory (1973), North-Holland: North-Holland Amsterdam), Chap. 23 · Zbl 0274.90022
[5] Rivest, R. L.; Meyer, A. R.; Kleitman, D. J.; Spencer, J., Binary search using unreliable comparisons, (Proceedings, 15th Annual Allerton Conference on Communication, Control, and Computing (Sept. 28-30, 1977)) · Zbl 0443.68043
[6] Schalkwijk, J. P.M., A class of simple and optimal strategies for block coding on the binary symmetric channel with noiseless feedback, IEEE Trans. Information Theory, 17, 3, 283-287 (1971) · Zbl 0222.94010
[7] Ulam, S. M., Adventures of a Mathematician, ((1976), Scribner’s: Scribner’s New York), 281 · Zbl 0352.01009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.