Skip to main content
SpringerLink
Log in

Error correction for channels with substitutions, insertions, and deletions

  • Decoding Methods and Techniques
  • Conference paper
  • First Online:
Information Theory and Applications II (CWIT 1995)

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

Included in the following conference series:

Abstract

We introduce a formal method for specifying the properties of discrete information channels and give a general definition of error correction. For the case of channels with substitutions, insertions and deletions, we derive the corresponding channel algebra. Given a description of such a channel and a finite set of words, it is decidable whether the set can correct all errors introduced by the channel.

We gratefully acknowledge the support of this work by the Natural Sciences and Engineering Research Council of Canada under Grant OGP0000243.

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.

References

  1. J. Berstel, D. Perrin: Theory of Codes. Academic Press, Orlando, 1985.

    Google Scholar 

  2. P. A. H. Bours: Construction of fixed-length insertion/deletion correcting runlength-limited codes. IEEE Trans. Inform. Theory, IT-40 (1994), 1841–1856.

    Google Scholar 

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

    Google Scholar 

  4. J. Duske, H. Jürgensen: Codierungstheorie. BI Wissenschaftsverlag, Mannheim, 1977.

    Google Scholar 

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

    Google Scholar 

  6. H. D. L. Hollman: A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes. IEEE Trans. Inform. Theory, IT-39 (1993), 1424–1427.

    Google Scholar 

  7. H. Jürgensen, S. Konstantinidis: The hierarchy of codes. In Z. Ésik (editor): Fundamentals of Computation Theory, 9th International Conference, FCT'93. Lecture Notes in Computer Science 710, 50–68, Berlin, 1993. Springer-Verlag.

    Google Scholar 

  8. H. Jürgensen, S. Konstantinidis: Variable-length codes for error correction. In Z. Fülöp, F. Gécseg (editors): Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Proceedings. Lecture Notes in Computer Science 944, 581–592, Berlin, 1995. Springer-Verlag.

    Google Scholar 

  9. H. Jürgensen, S. Konstantinidis: Codes. In G. Rozenberg, A. Salomaa (editors): Handbook of Formal Language Theory. Springer-Verlag, Berlin, to appear.

    Google Scholar 

  10. S. Konstantinidis: Error correction and decodability. PhD thesis, Department of Computer Science, The University of Western Ontario, 1996.

    Google Scholar 

  11. V. I. Levenshtein: Binary codes capable of correcting deletions, insertions, and reversals. Dokl. Akad. Nauk. SSSR, 163 (1965), 845–848, in Russian. English translation: Soviet Physics Dokl., 10 (1966), 707–710.

    Google Scholar 

  12. V. I. Levenshtein: Binary codes capable of correcting spurious insertions and deletions of ones. Problemy Peredachi Informatsii, 1(1) (1965), 12–25, in Russian. English translation: Problems Inform. Transmission, 1(1) (1966), 8–17.

    Google Scholar 

  13. V. I. Levenshtein: Asymptotically optimum binary code with correction for losses of one or two adjacent bits. Problemy Kibernet., 19 (1967), 293–298, in Russian. English translation: Systems Theory Research, 19 (1970), 298–304.

    Google Scholar 

  14. W. W. Peterson, E. J. Weldon, Jr.: Error-Correcting Codes. MIT Press, Cambridge, second ed., 1972.

    Google Scholar 

  15. R. M. Roth, P. H. Siegel: Lee-metric BCH codes and their application to constrained and partial-response channels. IEEE Trans. Inform. Theory, 40 (1994), 1083–1096.

    Google Scholar 

  16. F. F. Sellers, Jr.: Bit loss and gain correction code. IRE Trans. Inform. Theory, IT-8 (1962), 35–38.

    Google Scholar 

  17. H. J. Shyr: Free Monoids and Languages.Hon Min Book Company, Taichung, second ed., 1991.

    Google Scholar 

  18. L. Staiger: On infinitary finite length codes. RAIRO Inform. Théor. Appl., 20 (1986), 483–494.

    Google Scholar 

  19. R. R. Varshamov, G. M. Tenengol'ts: Codes capable of correcting single asymmetric errors. Avtomat. i Telemekh., 26 (1965), 288–292, in Russian.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Western Ontario, N6A 5B7, London, Ontario, Canada

    H. Jürgensen & S. Konstantinidis

Authors
  1. H. Jürgensen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Konstantinidis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Yves Chouinard Paul Fortier T. Aaron Gulliver

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jürgensen, H., Konstantinidis, S. (1996). Error correction for channels with substitutions, insertions, and deletions. In: Chouinard, JY., Fortier, P., Gulliver, T.A. (eds) Information Theory and Applications II. CWIT 1995. Lecture Notes in Computer Science, vol 1133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025142

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61748-8

  • Online ISBN: 978-3-540-70647-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation