Skip to main content
SpringerLink
Log in

Completion of finite codes with finite deciphering delay

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1989)

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

Included in the following conference series:

Abstract

We show how to embed any finite code with finite deciphering delay in a rational maximal code with the same deciphering delay. This answers a question in [1].

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6 References

  1. J. BERSTEL, D. PERRIN, “Theory of codes”, Academic Press, 1985.

    Google Scholar 

  2. V. BRUYERE, Completion of codes with finite deciphering delay, in preparation.

    Google Scholar 

  3. C. CHOFFRUT, Une caractérisation des codes à délai borné par leur fonction de décodage, In ”Théorie des codes” (D. Perrin Ed.) LITP.

    Google Scholar 

  4. A. EHRENFEUCHT, G. ROZENBERG, Elementary homomorphisms and a solution to the DOL sequence equivalence problem, Theoret. Comput. Sci. 7, 1978, 169–183.

    Article  Google Scholar 

  5. A. EHRENFEUCHT, G. ROZENBERG, Each regular code is included in a regular maximal code, RAIRO Informat. Theor., 1983, 89–96.

    Google Scholar 

  6. E.N. GILBERT, E.F. MOORE, Variable length binary encodings, Bell System Tech. J. 38, 1959, 933–967.

    Google Scholar 

  7. R. KARABED, B. MARCUS, Sliding-block coding for input-restricted channels, IEEE Trans. on Inform. Theory 34, 1988, 1–26.

    Article  Google Scholar 

  8. D. PERRIN, Completing biprefix codes, Lecture Notes in Computer Science 140, 1982, 397–406.

    Google Scholar 

  9. A. RESTIVO, On codes having nofinite completions, Diskrete Math. 17, 1977, 309–316.

    Article  Google Scholar 

  10. A.A. SARDINAS, C.W. PATTERSON, A necessary and sufficient condition for the unique decomposition of coded messages, IRE Internat. Conv. Rec. 8, 1953, 104–108.

    Google Scholar 

  11. M.P. SCHUTZENBERGER, Une théorie algébrique du codage, Séminaire Dubreil-Pisot, 1955–1956, Exposé no 15.

    Google Scholar 

  12. M.P. SCHUTZENBERGER, On a question concerning certain free submonoids, J. Combin. Theory 1, 1966, 437–442.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculté des Sciences, Avenue Maistriau, 15, 7000, Mons, Belgium

    Véronique Bruyere

Authors
  1. Véronique Bruyere
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Mariangiola Dezani-Ciancaglini Simonetta Ronchi Della Rocca

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bruyere, V. (1989). Completion of finite codes with finite deciphering delay. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035758

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51371-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation