Skip to main content
SpringerLink
Log in

Estimation of the exponent of the decoding error probability for a special generalized LDPC code

  • Articles from the Russian Journal Informatsionnye Protsessy
  • Published:
Journal of Communications Technology and Electronics Aims and scope Submit manuscript

Abstract

A special construction of a generalized low-density parity-check (LDPC) code and a low-complexity algorithm for his code decoding are proposed. A lower estimate of the exponent of the decoding error probability is obtained for the considered code and the decoding algorithm. This estimate leads the conclusion that, in an ensemble of considered LDPC codes, there are codes with rates as high as the code capacity and the exponent of the decoding error probability exceeds zero.

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. R. G. Gallager, Low-Density Parity-Check Codes (MIT Press, Massachusetts, 1963; Mir, Moscow, 1966).

    Google Scholar 

  2. V. V. Zyablov and M. S. Pinsker, “Assessment of the Complexity of Error Correction for Gallager Low-Density Codes,” Problemy Peredachi Inf. 11(1), 23–26 (1975).

    MATH  Google Scholar 

  3. P. S. Rybin and V. V. Zyabau]lov, “Asymptotic Estimation of Error Fraction Corrected by Binary LDPC Code,” in Proc. IEEE Int. Symp. on Information Theory (ISIT), St-Petersburg, July 31–Aug. 5, 2011 (IEEE, New, York, 2011), pp. 351–355.

    Chapter  Google Scholar 

  4. D. Burshtein and O. Barak, “Upper Bounds on the Error Exponents of LDPC Code Ensembles,” in Proc. IEEE Int. Symp. on Information Theory (ISIT), Seattle, W, July 9–14, 2006 (IEEE, New, York, 2011), pp. 401–405.

    Google Scholar 

  5. O. Barak and D. Burshtein, “Lower Bounds on the Error Rate of LDPC Code Ensembles,” IEEE Trans. Inf. Theory 53, 4225–4236 (2007).

    Article  MathSciNet  Google Scholar 

  6. R. G. Gallager, Information Theory and Reliable Communication (John Wiley & Sons, New York, 1968; Sov. Radio, Moscow, 1974).

    MATH  Google Scholar 

  7. E. L. Blokh and V. V. Zyablov, Linear Concatenated Codes (Nauka, Moscow, 1982) [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Bol’shoi Karetnyi per. 19 stroenie 1, Moscow, 127994, Russia

    V. V. Zyablov & P. S. Rybin

Authors
  1. V. V. Zyablov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. S. Rybin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © V.V. Zyablov, P.S. Rybin, 2012, published in Informatsionnye Protsessy, 2012, Vol. 12, No. 1, pp. 84–97.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zyablov, V.V., Rybin, P.S. Estimation of the exponent of the decoding error probability for a special generalized LDPC code. J. Commun. Technol. Electron. 57, 946–952 (2012). https://doi.org/10.1134/S1064226912080098

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation