Skip to main content

Construction of a family of finite maximal codes

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 88 (STACS 1988)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel, D. Perrin, Theory of codes, Academic Press, New York, 1985

    Google Scholar 

  2. J. Berstel, D. Perrin, Trends in the theory of codes, Bulletin of EATCS, n. 29, 85–95, 1986

    Google Scholar 

  3. J. Berstel, C. Reutenauer, Rational Series and their languages, Springer-Verlag, to appear

    Google Scholar 

  4. J. M. Boë, Sur les codes synchronisants coupants, in (A. de Luca ed.) Non commutative structures in algebra and geometric combinatorics (Arco Felice, 1978), Quaderni della ricerca scientifica del CNR (1981) 109, 7–10, 1978

    Google Scholar 

  5. J. M. Boë, Sur les codes factorisants, in (D. Perrin ed.) Théorie des codes, Actes de la septième école de printemps d'informatique théorique (Jougne 1979), 1–8, LITP (Paris), 1979

    Google Scholar 

  6. C. De Felice, A. Restivo, Some results on finite maximal codes, RAIRO Inform. théor., vol. 19, n. 4, 383–403, 1985

    Google Scholar 

  7. C. De Felice, C. Reutenauer, Solution partielle de la conjecture de factorisation des codes, C. R. Acad. Sc. Paris, 302, 169–170, 1986

    Google Scholar 

  8. S. Eilenberg, Automata, languages and machines, vol. A, Academic Press, New-York, 1974

    Google Scholar 

  9. L. Fuchs, Abelian groups, Pergamon Press, 1960

    Google Scholar 

  10. M. Krasner, B. Ranulac, Sur une propriété des polynômes de la division du cercle, C. R. Acad. Sc. Paris, 240, 397–399, 1937

    Google Scholar 

  11. D. Perrin, M. P. Schützenberger, Un problème élémentaire de la théorie de l'information, Colloques internationaux du CNRS, n. 276, Cachan, 1977

    Google Scholar 

  12. A. Restivo, On codes having no finite completions, Discrete Math., 17, 309–316, 1977

    Google Scholar 

  13. A. Restivo, S. Salemi, T. Sportelli, Completing codes, Report Dip. Mat. Palermo, 1986

    Google Scholar 

  14. C. Reutenauer, Sulla fattorizzazione dei codici, Ricerche di Matematica, vol. XXXII, 115–130, 1985

    Google Scholar 

  15. C. Reutenauer, Non commutative factorization of variable — length codes, J. Pure Applied Algebra, 36, 167–186, 1985

    Google Scholar 

  16. C. Reutenauer, private communication

    Google Scholar 

  17. S. Salemi, private communication

    Google Scholar 

  18. A. D. Sands, The factorization of abelian group, Quart. J. Math. Oxford Series 2, t. 10, 81–91, 1959

    Google Scholar 

  19. M. P. Schützenberger, Une théorie algébrique du codage, Séminaire Dubreil-Pisot, 1955–1956, Exposé n. 15, 1955

    Google Scholar 

  20. M. P. Schützenberger, Codes à longuer variable, in (D. Perrin ed.) Théorie des codes, Actes de la septième école de printemps d'informatique théorique (Jougne 1979), 247–271, LITP (Paris), 1965

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Robert Cori Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Felice, C. (1988). Construction of a family of finite maximal codes. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035842

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18834-6

  • Online ISBN: 978-3-540-48190-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics