Skip to main content
SpringerLink
Log in

Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel

  • Coding Theory
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

A lower bound for the number of iteratively correctable erasures is given, with application to the ensemble of LDPC codes with parity-check matrices composed of permutation matrices [1]. We assume that the Zyablov-Pinsker iterative decoding algorithm [2] is used. Its complexity is O(N log N), where N is the block length.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Sridharan, A., Lentmaier, M., Truhachev, D.V., Costello, D.J., Jr., and Zigangirov, K.Sh., On the Minimum Distance of Low-Density Parity-Check Codes with Parity-Check Matrices Constructed from Permutation Matrices, Probl. Peredachi Inf., 2005, vol. 41, no. 1, pp. 39–52 [Probl. Inf. Trans. (Engl. Transl.), 2005, vol. 41, no. 1, pp. 33–44].

    MATH  Google Scholar 

  2. Zyablov, V.V. and Pinsker, M.S., Decoding Complexity of Low-Density Codes for Transmission in a Channel with Erasures, Probl. Peredachi Inf., 1974, vol. 10, no. 1, pp. 15–28 [Probl. Inf. Trans. (Engl. Transl.), 1974, vol. 10, no. 1, pp. 10–21].

    MATH  Google Scholar 

  3. Gallager, R.G., Low-Density Parity-Check Codes, Cambridge: MIT Press, 1963.

    Google Scholar 

  4. Luby, M.G., Mitzenmacher, M., Shokrollahi, M.A., and Spielman, D.A., Efficient Erasure Correcting Codes, IEEE Trans. Inform. Theory, 2001, vol. 47, no. 2, pp. 569–584.

    Article  MATH  MathSciNet  Google Scholar 

  5. Zyablov, V.V. and Pinsker, M.S., Estimation of the Error-Correction Complexity for Gallager Low-Density Codes, Probl. Peredachi Inf., 1975, vol. 11, no. 1, pp. 23–36 [Probl. Inf. Trans. (Engl. Transl.), 1975, vol. 11, no. 1, pp. 18–28].

    MATH  Google Scholar 

  6. Lentmaier, M., Truhachev, D.V., Zigangirov, K.Sh., and Costello, D.J., Jr., An Analysis of the Block Error Probability Performance of Iterative Decoding, IEEE Trans. Inform. Theory, 2005, vol. 51, no. 11, pp. 3834–3855.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Information Transmission Problems, RAS, Moscow, Russia

    D. K. Zigangirov & K. Sh. Zigangirov

Authors
  1. D. K. Zigangirov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Sh. Zigangirov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © D.K. Zigangirov, K.Sh. Zigangirov, 2006, published in Problemy Peredachi Informatsii, 2006, Vol. 42, No. 2, pp. 44–52.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zigangirov, D.K., Zigangirov, K.S. Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel. Probl Inf Transm 42, 106–113 (2006). https://doi.org/10.1134/S0032946006020049

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946006020049

Keywords

Search

Navigation