Advertisement

On a Family of Codes with Bounded Deciphering Delay

  • Long Van Do
  • Igor Litovsky
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2450)

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.

Keywords

Special Kind Related Family Small Integer Regular Language Original Message 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berstel, J. and Perrin, D.: Theory of Codes. Academic Press, New York, London, 1985.zbMATHGoogle Scholar
  2. 2.
    Devolder, J., Latteux, M., Litovsky, I., Staiger, L.: Codes and infinite words. Acta Cybern. 11 (1994) 241–256.zbMATHMathSciNetGoogle Scholar
  3. 3.
    Golomb S. W., Gordon B.: Codes with bounded synchronization delay. Inform. and Contr. 8 (1965) 355–372.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Golomb, S. W., Gordon B., Welch L. R.: Comma-free codes. Canad. J. Math. 10 (1958) 202–209.zbMATHMathSciNetGoogle Scholar
  5. 5.
    Ito, M., Thierrin, G.: Congruences, infix and cohesive prefix codes. Theoret. Comput. Sci. 136 (1984) 471–485.CrossRefMathSciNetGoogle Scholar
  6. 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. 7.
    Shyr, H. J.: Free Monoids and Languages. Lecture Notes, Hon Min Book Company, Taichung, 1991.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Long Van Do
    • 1
  • Igor Litovsky
    • 2
  1. 1.Institute of MathematicsHanoiVietnam
  2. 2.ESSISophia AntipolisFrance

Personalised recommendations