Quasi-questionnaires, codes and Huffman's length

Claude-François Picard

Kybernetika (1970)

  • Volume: 06, Issue: 6, page (418)-435
  • ISSN: 0023-5954

How to cite

top

Picard, Claude-François. "Quasi-questionnaires, codes and Huffman's length." Kybernetika 06.6 (1970): (418)-435. <http://eudml.org/doc/27949>.

@article{Picard1970,
author = {Picard, Claude-François},
journal = {Kybernetika},
language = {eng},
number = {6},
pages = {(418)-435},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Quasi-questionnaires, codes and Huffman's length},
url = {http://eudml.org/doc/27949},
volume = {06},
year = {1970},
}

TY - JOUR
AU - Picard, Claude-François
TI - Quasi-questionnaires, codes and Huffman's length
JO - Kybernetika
PY - 1970
PB - Institute of Information Theory and Automation AS CR
VL - 06
IS - 6
SP - (418)
EP - 435
LA - eng
UR - http://eudml.org/doc/27949
ER -

References

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

NotesEmbed ?

top

You must be logged in to post comments.