Skip to main content
SpringerLink
Log in

On the degree of finite maximal biprefix codes

  • Research Article
  • Published:
Semigroup Forum Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. J. Berstel and D. Perrin, “Theory of codes”,Pure and Applied Mathematics,117,Academic Press, 1985.

  2. E.N. Gilbert and E.F. Moore, Variable length binary encodings,Bell system Tech. J. (1959),38,933–967.

    MathSciNet  Google Scholar 

  3. M.P. Schützenberger, On a special class of reccurent events,Ann. Math. Statist. (1961),32,1201–1213.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Théorique et de programmation, Université Paris VII, 2 Place Jussieu, 75251, Paris Cedex 5, France

    Laurent Rosaz (Visitor)

  2. Department of Mathematics, Pennsylvania State University, 16801, University Park, Pa, USA

    Laurent Rosaz (Visitor)

Authors
  1. Laurent Rosaz
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Gerard Lallement

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rosaz, L. On the degree of finite maximal biprefix codes. Semigroup Forum 48, 327–331 (1994). https://doi.org/10.1007/BF02573681

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation