Quasi-questionnaires, codes and Huffman’s length. (English) Zbl 0215.30901


94A50 Theory of questionnaires
94B99 Theory of error-correcting codes and error-detecting codes
Full Text: EuDML


[1] R. Ash: Information Theory. Interscience Pub., New York 1965. · 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 3ème Cycle (Lyon) 1967.
[4] A. Feinstein: Foundations of information theory. Mc Graw Hill, New York 1958. · Zbl 0082.34602
[5] D. A. Huffman: A method for the construction of minimum-redundancy codes. Proc. IRE (1952), 9, 1098. · Zbl 0137.13605 · doi:10.1109/JRPROC.1952.273898
[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. · Zbl 0128.39002
[8] A. Renyi: Wahrscheinlichkeitsrechnung. VEB Deutscher Verlag der Wissenschaften, Berlin 1962. · Zbl 0102.34403
[9] C. E. Shannon: The mathematical theory of communications. Bell System - Technical Journal (1948). · Zbl 1154.94303
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.