Quasi-questionnaires, codes and Huffman's length
Kybernetika (1970)
- Volume: 06, Issue: 6, page (418)-435
- ISSN: 0023-5954
Access Full Article
topHow to cite
topReferences
top- R. Ash, Information Theory, Interscience Pub., New York 1965. (1965) Zbl0141.34904MR1088248
- Y. Cesari, Questionnaire, Codage et Tris, Publication de ľlnstitut Blaise Pascal, Paris 1968. (1968)
- F. Dubail, Algorithmes de questionnaires optimaux au sens de divers critères, Thèse Зème Cycle (Lyon) 1967. (1967)
- A. Feinstein, Foundations of information theory, Mc Graw Hill, New York 1958. (1958) Zbl0082.34602MR0095087
- D. A. Huffman, A method for the construction of minimum-redundancy codes, Proc. IRE (1952), 9, 1098. (1952) Zbl0137.13605
- F. Jelinek, Probabilistic Information Theory discrete and memoryless models, Mc Graw Hill, New York 1968. (1968) Zbl0174.50702
- C. F. Picard, Théorie des Questionnaires, Gauthier-Villars, Paris 1965. (1965) Zbl0128.39002MR0199036
- A. Renyi, Wahrscheinlichkeitsrechnung, VEB Deutscher Verlag der Wissenschaften, Berlin 1962. (1962) Zbl0102.34403MR0474442
- C. E. Shannon, The mathematical theory of communications, Bell System - Technical Journal (1948). (1948)