Skip to main content

Fast algorithms for decoding orthogonal and related codes

  • Invited Contributions
  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1991)

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

Abstract

If we require not a whole spectrum but only its maximal element, we may truncate well-known fast orthogonal transformation algorithms decreasing significantly their complexity. This approach leads to a very simple decoding algorithms which are surveyed in the paper.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.R. Green, "A serial orthogonal decoder", JPL Space Programs Summary, Vol. 37-39-IY, pp.247–253, 1966.

    Google Scholar 

  2. C. Rushforth, "Fast Fourier-Hadamard decoding of orthogonal codes", Information and Control, Vol.15, pp.33–37, 1969.

    Google Scholar 

  3. F.J. MacWilliams, and N.J.A.Sloane, The theory of error-correcting codes, North-Holland P.C., 1977.

    Google Scholar 

  4. G.D. Forney, Jr., "Coset codes II: Binary lattices and related codes", IEEE Trans. Inform. Theory, vol.IT-34, pp.1152–1187, 1988.

    Google Scholar 

  5. A.Ashikhmin, A,Dmitriyev, S.Litsyn and S.Portnoy, Patent USSR, No.4433980, 1988.

    Google Scholar 

  6. S. Litsyn and O. Shekhovtsov, "Fast decoding algorithm for first order Reed-Muller codes", Problems of Information Transmission, v.19, 2, pp.3–7, 1983 (in Russian).

    Google Scholar 

  7. A. Ashikhmin and S. Litsyn, "Analysis of quasi-optimal decoding algorithms of biorthogonal codes", Radioelectronica, v.31, 11, pp.30–34, 1988 (in Russian).

    Google Scholar 

  8. S. Litsyn, G. Mikhailovskaya, E. Nemirovsky and O. Shekhovtsov, "Fast decoding of first order Reed-Muller codes in the Gaussian channel", Problems of Control and Information Theory, vol.14, 3, pp.189–201, 1985.

    Google Scholar 

  9. A.Ashikhmin and S.Litsyn, "Fast decoding algorithms for first order Reed-Muller and related codes", IEEE Trans.Inform.Theory, submitted.

    Google Scholar 

  10. A. Ashikhmin and S. Litsyn, "List algorithm for search of the maximal element of Walsh transform", Radioelectronica, v.32, 3, pp.15–22, 1990 (in Russian).

    Google Scholar 

  11. S.Litsyn, "Fast decoding of non-binary orthogonal codes", in preparation.

    Google Scholar 

  12. S. Litsyn, "Fast decoding algorithm of Reed-Muller codes", 4th Joint Swedish-Soviet International Workshop on Information Theory, Gotland, Sweden, 1989, pp.288–291.

    Google Scholar 

  13. J.-P. Adoul, "Fast ML decoding algorithm for the Nordstrom-Robinson code", IEEE Trans. Inform. Theory, vol.IT-33, pp.931–933, 1987.

    Google Scholar 

  14. Z. Ben-Neticha, P. Mabilleau, and J.-P. Adoul, "The ‘stretched'-Golay and other codes for high-SNR finite-delay quantization of the gaussian source at 1/2 bit per sample", IEEE Transactions on Comm., vpl.38, 12, pp.2089–2093, 1990.

    Google Scholar 

  15. Y. Be'ery and J. Snyders, "Optimal soft decision block decoders based on fast Hadamard transform", IEEE Trans.Inform.Theory, vol.IT-32, pp.355–364, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Harold F. Mattson Teo Mora T. R. N. Rao

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Litsyn, S.N. (1991). Fast algorithms for decoding orthogonal and related codes. In: Mattson, H.F., Mora, T., Rao, T.R.N. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1991. Lecture Notes in Computer Science, vol 539. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54522-0_94

Download citation

  • DOI: https://doi.org/10.1007/3-540-54522-0_94

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54522-4

  • Online ISBN: 978-3-540-38436-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics