Skip to main content
SpringerLink
Log in

On a Family of Codes with Bounded Deciphering Delay

  • Conference paper
  • First Online:
Book cover Developments in Language Theory (DLT 2002)

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

Included in the following conference series:

  • 331 Accesses

Abstract

A special kind of codes with bounded deciphering delay, called k-comma-free codes, is considered. The advantage in using these codes is that the decoding can begin “anywhere” in a coded message. This means that a coded message can be deciphered even when it might be lost partially. Related families of codes with bounded deciphering delay are also considered. Criteria to test these codes are established in a unified way.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J. and Perrin, D.: Theory of Codes. Academic Press, New York, London, 1985.

    MATH  Google Scholar 

  2. Devolder, J., Latteux, M., Litovsky, I., Staiger, L.: Codes and infinite words. Acta Cybern. 11 (1994) 241–256.

    MATH  MathSciNet  Google Scholar 

  3. Golomb S. W., Gordon B.: Codes with bounded synchronization delay. Inform. and Contr. 8 (1965) 355–372.

    Article  MATH  MathSciNet  Google Scholar 

  4. Golomb, S. W., Gordon B., Welch L. R.: Comma-free codes. Canad. J. Math. 10 (1958) 202–209.

    MATH  MathSciNet  Google Scholar 

  5. Ito, M., Thierrin, G.: Congruences, infix and cohesive prefix codes. Theoret. Comput. Sci. 136 (1984) 471–485.

    Article  MathSciNet  Google Scholar 

  6. Sardinas A. A., Patterson C. W.: A necessary and sufficient condition for the unique decomposition of coded messages. IRE Internat. Conv. Rec. 8 (1953) 104–108.

    Google Scholar 

  7. Shyr, H. J.: Free Monoids and Languages. Lecture Notes, Hon Min Book Company, Taichung, 1991.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Bo Ho, P.O. Box 631, 10000, Hanoi, Vietnam

    Long Van Do

  2. ESSI, 930 route des Colles, BP 145, 06903, Sophia Antipolis, France

    Igor Litovsky

Authors
  1. Long Van Do
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Igor Litovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Faculty of Engineering, Kyoto Sangyo University, 603-8555, Kyoto, Japan

    Masami Ito  & Masafumi Toyama  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Van Do, L., Litovsky, I. (2003). On a Family of Codes with Bounded Deciphering Delay. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-45005-X_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation