Skip to main content
SpringerLink
Log in

Partial ordering of error patterns for maximum likelihood soft decoding

  • Conference paper
  • First Online:
Algebraic Coding (Algebraic Coding 1991)

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

Included in the following conference series:

Abstract

The error patterns, encountered in maximum likelihood soft decision syndrome decoding of a binary linear block code, can be partially ordered in a way that only the minimal elements have to be scored. The ordering requires a usually short sorting proceedure applied to the confidence values of the hard-detected bits. In this paper some properties of the minimal elements are derived. We also present bounds on the number of minimal elements with particularly large Hamming weight.

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. H. Miyakawa and T. Kaneko, “Decoding algorithm of error-correcting codes by use of analog weights,” Electronics Communications in Japan, vol. 58-A, pp. 18–27, 1975.

    Google Scholar 

  2. J. Snyders and Y. Beéry, “Maximum likelihood soft decoding a binary block codes and decoders for the Golay codes,” IEEE Trans. Inform. Theory, vol. IT-35, pp. 963–975, 1989.

    Article  Google Scholar 

  3. S. Litsyn and E. Nemirovsky, “Simplification of maximum likelihood decoding of block codes on the basis of the Viterbi algorithm,” Trudy Instituta Ingenerov Radio, vol. 2, pp. 17–27, 1988 (in Russian).

    Google Scholar 

  4. G.D. Forney, Jr., Concatenated Codes. Cambridge, Massachusetts: The MIT Press, pp. 61–62, 1966.

    Google Scholar 

  5. D. Chase, “A class of algorithms for decoding block codes with channel measurement information,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 170–182, 1972.

    Article  Google Scholar 

  6. E.R. Berlekamp, “The construction of fast, high-rate, soft decision block decoders,” IEEE Trans. Inform. Theory, vol. IT-29, pp.372–377, 1983.

    Article  Google Scholar 

  7. J. Snyders, “Reduced lists of error patterns for maximum likelihood soft decoding,” IEEE Trans. Inform. Theory, to be published.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering - Systems, Tel Aviv University, 69978, Ramat Aviv, Israel

    Jakov Snyders

Authors
  1. Jakov Snyders
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Antoine Lobstein Gilles Zémor Simon Litsyn

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Snyders, J. (1992). Partial ordering of error patterns for maximum likelihood soft decoding. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S. (eds) Algebraic Coding. Algebraic Coding 1991. Lecture Notes in Computer Science, vol 573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034348

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55130-0

  • Online ISBN: 978-3-540-46739-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation