×

A discrete theory of search. II. (English) Zbl 0231.62095


MSC:

90B40 Search theory
94A24 Coding theorems (Shannon theory)

Citations:

Zbl 0231.62094
PDFBibTeX XMLCite
Full Text: EuDML

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 · doi:10.1090/S0002-9904-1965-11402-1
[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
[7] I. Vajda: On the convergence of information contained in a sequence of observations. Proc. Coll. on Inf. Theory, Debrecen 1967, Budapest 1969. · Zbl 0187.16903
[8] R. M. Fano: Transmission of information. M.I.T. Press & Wiley, N.Y. 1961.
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.