Skip to main content
Springer Nature Link
Log in

Upper bound on the minimum distance of LDPC codes over GF(q) based on counting the number of syndromes

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

Abstract

In [1] a syndrome counting based upper bound on the minimum distance of regular binary LDPC codes is given. In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). A comparison with the lower bound for LDPC codes over GF(q), upper bound for the codes over GF(q), and the shortening upper bound for LDPC codes is made. The new bound is shown to lie under the Gilbert–Varshamov bound at high rates.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Ben-Haim, Y. and Litsyn, S., Upper Bounds on the Rate of LDPC Codes as a Function of Minimum Distance, IEEE Trans. Inform. Theory, 2006, vol. 52, no. 5, pp. 2092–2100.

    Article  MathSciNet  MATH  Google Scholar 

  2. Gallager, R.G., Low-Density Parity-Check Codes, Cambridge: MIT Press, 1963. Translated under the title Kody s maloi plotnost’yu proverok na chetnost’, Moscow: Mir, 1966.

  3. Tanner, R.M., A Recursive Approach to Low Complexity Codes, IEEE Trans. Inform. Theory, 1981, vol. 27, no. 5, pp. 533–547.

    Article  MathSciNet  MATH  Google Scholar 

  4. Frolov, A.A. and Zyablov, V.V., Bounds on the Minimum Code Distance for Nonbinary Codes Based on Bipartite Graphs, Probl. Peredachi Inf., 2011, vol. 47, no. 4, pp. 27–42 [Probl. Inf. Trans. (Engl. Transl.), 2011, vol. 47, no. 4, pp. 327–341].

    MathSciNet  MATH  Google Scholar 

  5. Ben-Haim, Y. and Litsyn, S., A New Upper Bound on the Rate of Non-Binary Codes, Proc. 2006 IEEE Int. Sympos. on Information Theory (ISIT’2006), Seattle, WA,USA, July 9–14, 2006, pp. 297–301.

    Chapter  Google Scholar 

  6. Bassalygo, L.A., New Upper Bounds for Error Correcting Codes, Probl. Peredachi Inf., 1965, vol. 1, no. 4, pp. 41–44 [Probl. Inf. Trans. (Engl. Transl.), 1965, vol. 1, no. 4, pp. 32–35].

    MathSciNet  MATH  Google Scholar 

  7. Aaltonen, M., A New Upper Bound on Nonbinary Block Codes, Discrete Math., 1990, vol. 83, no. 2–3, pp. 139–160.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

    A. A. Frolov

Authors
  1. A. A. Frolov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. A. Frolov.

Additional information

Original Russian Text © A.A. Frolov, 2016, published in Problemy Peredachi Informatsii, 2016, Vol. 52, No. 1, pp. 8–15.

The research was carried out at the Institute for Information Transmission Problems of the Russian Academy of Sciences at the expense of the Russian Science Foundation, project no. 14-50-00150.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Frolov, A.A. Upper bound on the minimum distance of LDPC codes over GF(q) based on counting the number of syndromes. Probl Inf Transm 52, 6–13 (2016). https://doi.org/10.1134/S0032946016010026

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation