Skip to main content
SpringerLink
Log in
Book cover

International Conference on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes

AAECC 1988: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes pp 239–249Cite as

Multiple error correction with Analog Codes

  • Full Papers
  • Conference paper
  • First Online:

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

Abstract

After pointing out the expected advantages of complex coding compared to usual RS- or BCH-codes over finite fields, it has been shown that ”Analog Codes” are able to correct multiple errors (bursts) also if additional background noise is superimposed. Simulations made obvious that the amplitude of the noise has to be of considerably lower amplitude than the ‘bursts’ to be corrected. Furthermore, it has been stated that intermediate solutions during execution of the recursive Berlekamp-Massey-Algorithm are not meaningless but represent a measure for the conditioning of the corresponding sub-Toeplitz system.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wolf, J.K., ”Redundancy, the Discrete Fourier Transform, and Impulse Noise Cancellation”, IEEE Trans. on Comm., vol. COM-31, No. 3, pp. 458–461, March 1983.

    Google Scholar 

  2. Wolf, J.K., ”Analog Codes”, IEEE Int. Conf. on Comm. (ICC '83), Boston, MA, USA, 19–22 June 1983, pp. 310–312 vol. 1.

    Google Scholar 

  3. Hildebrandt, F.B., Introduction to numercal analysis, McGraw-Hill, New York, Toronto, London, 1956.

    Google Scholar 

  4. Golub, G.H., van Loan, C.F., Matrix Computations, North Oxford Academic Publishing, Oxford, 1983

    Google Scholar 

  5. Massey, J.L., ”Shift-Register Synthesis and BCH Decoding”, IEEE Trans. on Inf. Theory, vol. IT-15, No. 1, pp. 122–127, January 1969.

    Google Scholar 

  6. Marshall, T.G., ”Real number transform and convolutional codes”, in Proc. 24th Midwest Symp. Circuits Syst., S. Karne, Ed., Albuquerque, NM, June 29–30, 1981.

    Google Scholar 

  7. Maekawa, Y., Sakaniwa, K., “An Extension of DFT Code and the Evaluation of its Performance”, Int. Symp. on Information Theory, Brighton, England June 24–28, 1985.

    Google Scholar 

  8. Cybenko, G., ”The numerical stability of the Levinson-Durbin Algorithm for Toeplitz systems of equations”, SIAM J. Sci. Stat. Comput., vol. 1, No. 3, pp. 303–319, September 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Netzwerk- und Signaltheorie, Technische Hochschule Darmstadt, Merckstr. 25, D-6100, Darmstadt

    Werner Henkel

Authors
  1. Werner Henkel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Teo Mora

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Henkel, W. (1989). Multiple error correction with Analog Codes. In: Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1988. Lecture Notes in Computer Science, vol 357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51083-4_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-51083-4_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51083-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation