Vajda, Igor A discrete theory of search. I. (English) Zbl 0231.62094 Apl. Mat. 16, 241-255 (1971). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 Review MSC: 90B40 Search theory 94A24 Coding theorems (Shannon theory) 62L12 Sequential estimation Citations:Zbl 0231.62095 PDF BibTeX XML Cite \textit{I. Vajda}, Apl. Mat. 16, 241--255 (1971; Zbl 0231.62094) Full Text: EuDML OpenURL References: [1] I. Vajda: On random design of experiments. (in Russian). Information Transmission Problems 4 (1968), N. 4, 26-36. [2] A. Rényi: On the theory of random search. Bull. Amer. Math. Soc. 71 (1965), N. 1, 809-828. · Zbl 0138.14706 [3] J. Nedoma: Coding of finite sets of messages. Presented at 2nd Czechoslovak Conf. on Cybernetics, Prague 16.-19. XI. 1965. [4] A. Feinstein: Foundations of Information Theory. McGraw Hill, N. Y. 1958. · Zbl 0082.34602 [5] I. Vajda: Rate of convergence of the information in a sample concerning a parameter. Czechoslovak Math. Journal, 17 (1967), N. 2, 225-231. · Zbl 0189.18901 [6] I. Vajda: On statistical decision problems with finite parameter space. Kybernetika 3 (1967), N. 5, 451-466. · Zbl 0201.51602 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.