Quasi-questionnaires, codes and Huffman's length

Previous | Up | Next

Article

Quasi-questionnaires, codes and Huffman's length. (English). Kybernetika, vol. 6 (1970), issue 6, pp. (418)-435

MSC: 05.00, 94.10, 94A50, 94B99 | MR 0284274 | Zbl 0215.30901

References:

[1] R. Ash: Information Theory. Interscience Pub., New York 1965. MR 1088248 | Zbl 0141.34904

[2] Y. Cesari: Questionnaire, Codage et Tris. Publication de ľlnstitut Blaise Pascal, Paris 1968.

[3] F. Dubail: Algorithmes de questionnaires optimaux au sens de divers critères. Thèse Зème Cycle (Lyon) 1967.

[4] A. Feinstein: Foundations of information theory. Mc Graw Hill, New York 1958. MR 0095087 | Zbl 0082.34602

[5] D. A. Huffman: A method for the construction of minimum-redundancy codes. Proc. IRE (1952), 9, 1098. Zbl 0137.13605

[6] F. Jelinek: Probabilistic Information Theory discrete and memoryless models. Mc Graw Hill, New York 1968. Zbl 0174.50702

[7] C. F. Picard: Théorie des Questionnaires. Gauthier-Villars, Paris 1965. MR 0199036 | Zbl 0128.39002

[8] A. Renyi: Wahrscheinlichkeitsrechnung. VEB Deutscher Verlag der Wissenschaften, Berlin 1962. MR 0474442 | Zbl 0102.34403

[9] C. E. Shannon: The mathematical theory of communications. Bell System - Technical Journal (1948).

Partner of