Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1985: Fundamentals of Computation Theory pp 351–360Cite as

Recent results on codes

  • Conference paper
  • First Online:

  • 106 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 199))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel, D. Perrin, The Theory of Codes, Acad. Press, to appear.

    Google Scholar 

  2. J.M. Boë, Un problème combinatoire de la théorie des codes, Actes du colloque "Algorithmique et Complexité", Avignon (1983), B. Rozoy ed.

    Google Scholar 

  3. J. Betréma, Classification et représentation de systèmes d'action, Thèse 3ème cycle, Univ. Paris 7 (1981).

    Google Scholar 

  4. Y. Césari, Sur l'application du théorème de Suschkewitsch à l'étude des codes rationnels complets, in J. Loeckx (ed.), Automata, Language and Programming, Springer Verlag (1974) 342–350.

    Google Scholar 

  5. Y. Césari, Un algorithme donnant les codes bipréfixes finis, Math. System Theory 6 (1972) 221–225.

    Google Scholar 

  6. P.M. Cohn, Free rings and their relations,Acad. Press (1971).

    Google Scholar 

  7. C. De Felice, Construction de codes factorisants, Theor. Comput. Sci. To appear.

    Google Scholar 

  8. C. De Felice, Extension de l'algorithme de construction des codes biprefixes aux chemins dans les graphes, in preparation.

    Google Scholar 

  9. C. De Felice, A. Restivo, Some results on finite maximal codes, RAIRO Informatique théorique, to appear.

    Google Scholar 

  10. A. Ehrenfeucht, G. Rozenberg, RAIRO Informatique théorique, to appear.

    Google Scholar 

  11. S. Eilenberg, Automata, languages and machines, vol. A, Acad. Press (1974).

    Google Scholar 

  12. W. Feller, An introduction to probability theory and its applications, John Wiley (1957)

    Google Scholar 

  13. G. Hansel, D. Perrin, C. Reutenauer, Factorizing the polynomial of a code, Trans. Amer. Math. Soc. 285 (1984) 91–105.

    Google Scholar 

  14. G. Lallement, Semigroups and combinatorial applications, John Wiley (1979).

    Google Scholar 

  15. M. Léonard, Thèse 3ème cycle, Univ. Rouen (1985).

    Google Scholar 

  16. D. Perrin, Codes asynchrones, Bull. Soc. Math France, Bull. Soc. Math. France, 105 (1977) 385–404.

    Google Scholar 

  17. D. Perrin, Sur la transitivité du groupe d'un code bipréfixe fini, Math. Z. 153 (1977) 283–287.

    Google Scholar 

  18. C. Reutenauer, Semisimplicity of the algebra associated to a biprefix code, Semigroup Forum 23 (1981) 327–342.

    Google Scholar 

  19. C. Reutenauer, Noncommutative factorization of variable-length codes, J. Pure Applied Algebra, to appear.

    Google Scholar 

  20. C. Reutenauer, Ensembles libres de chemins dans un graphe, submitted.

    Google Scholar 

  21. M.P. Schützenberger, On an application of semigroup methods to some problem in coding, IRE Trans. Information Theory 2 (1956) 47–60.

    Google Scholar 

  22. M.P. Schützenberger, Sur certains sous-monoïdes libres, Bull. Soc. Math. France. 93 (1965) 209–223.

    Google Scholar 

  23. C.E. Shannon, A mathematical theory of communication, Bell System Tech. J. 27 (1948) 379–423, 623–656.

    Google Scholar 

  24. P. Shor, A counterexample to the triangle conjecture, J. Combin. Theory A 38 (1985) 110–112.

    Google Scholar 

  25. M. Vincent, Construction de codes indécomposables, RAIRO Informatique Théorique to apper.

    Google Scholar 

  26. P. Weil, Thèse 3ème cycle, Univ. Paris 7 (1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut de Programmation, CNRS, 4 Place Jussieu, 75005, Paris, France

    Christophe Reutenauer

Authors
  1. Christophe Reutenauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reutenauer, C. (1985). Recent results on codes. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028819

Download citation

  • DOI: https://doi.org/10.1007/BFb0028819

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation