On the multiple threshold decoding of LDPC codes over GF(q)

Alexey Frolov, Victor Zyablov

    Research output: Contribution to journalArticlepeer-review


    We consider decoding of LDPC codes over GF(q) with a hard-decision low-complexity majority algorithm, which is a generalization of the bit-flipping algorithm for binary LDPC codes. A modification of this algorithm with multiple thresholds is suggested. A lower estimate on the decoding radius realized by the new algorithm is derived. The estimate is shown to be better than the estimate for a single threshold majority decoder. At the same time, introducing multiple thresholds does not affect the order of decoding complexity.

    Original languageEnglish
    Pages (from-to)123-137
    Number of pages15
    JournalAdvances in Mathematics of Communications
    Issue number1
    Publication statusPublished - Feb 2017


    • Coding theory
    • Decoding radius
    • Iterative decoding
    • LDPC codes
    • Majority logic decoding
    • Threshold decoding


    Dive into the research topics of 'On the multiple threshold decoding of LDPC codes over GF(q)'. Together they form a unique fingerprint.

    Cite this