Previous |  Up |  Next

Article

References:
[1] A. Feinstein: Foundation of Information Theory. McGraw Hill, New York 1958. MR 0095087
[2] C. F. Picard: Quasi-questionnaire, codes and Huffman's length. Kybernetika 6 (1970), 6. MR 0284274
[3] L. N. Landa: Opit primenenija matematičeskoj logiki i teorii informacii k nekotorym problemam obučenija. Voprosy psichologii (1962), 2, 19-40.
[4] D. E. Knuth: Optimal. Binary Search Trees. Acta informatica 1 (1971), 1.
[5] A. Renyi: On the enumeration of search-codes. Acta Math. Acad. Sci. Hung. 21 (1970), 27-33. MR 0274194 | Zbl 0228.05003
[6] S. Guiasu: On the most rational algorithm of recognition. Kybernetik 5 (sept. 1968), 109-113. Zbl 0177.48001
Partner of
EuDML logo