A property of biprefix codes

Martine Leonard

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1988)

  • Volume: 22, Issue: 3, page 311-318
  • ISSN: 0988-3754

How to cite

top

Leonard, Martine. "A property of biprefix codes." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 22.3 (1988): 311-318. <http://eudml.org/doc/92310>.

@article{Leonard1988,
author = {Leonard, Martine},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {recognizable biprefix code; full words},
language = {eng},
number = {3},
pages = {311-318},
publisher = {EDP-Sciences},
title = {A property of biprefix codes},
url = {http://eudml.org/doc/92310},
volume = {22},
year = {1988},
}

TY - JOUR
AU - Leonard, Martine
TI - A property of biprefix codes
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1988
PB - EDP-Sciences
VL - 22
IS - 3
SP - 311
EP - 318
LA - eng
KW - recognizable biprefix code; full words
UR - http://eudml.org/doc/92310
ER -

References

top
  1. 1. J. BERSTEL and D. PERRIN, Theory of Codes, Academic Press, 1985. Zbl0587.68066MR797069
  2. 2. Y. CESARI, Sur un algorithme donnant les codes bipréfixes finis, Math. Syst. Theory, Vol. 6, 1972, pp. 221-225. Zbl0241.94015MR319651
  3. 3. Y. CESARI, Propriétés Combinatoires des codes bipréfixes complets finis, in Actes de la Septième École de Printemps d'Informatique Théorique, Jougne, 1979, D. Perrin ed., LITP. 
  4. 4. S. EILENBERG, Automata, Languages and Machines, Academic Press, Vol. A, 1974, p. 32. Zbl0317.94045
  5. 5. E. N. GILBERT and E. F. MOORE, Variable-length Binary Encodings, Bell. Syst. Techn., J38, 1959, pp. 933-967. MR108413
  6. 6. M. LÉONARD, Thèse de Doctorat ès Sciences, Université de Rouen, 1985. 

NotesEmbed ?

top

You must be logged in to post comments.