On the Decoding Radius Realized by Low-Complexity Decoded Non-Binary Irregular LDPC Codes

Pavel Rybin, Alexey Frolov

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Citations (Scopus)

    Abstract

    In this paper we consider the low complexity majority-logic decoding algorithm for irregular non-binary low-density parity-check (LDPC) codes. The decoding algorithm is a generalization of the bit-flipping algorithm for binary LDPC codes. The lower estimate on the decoding radius realized by this algorithm is derived for the first time for irregular non-binary LDPC codes. We present the numerical results for the derived lower bound.

    Original languageEnglish
    Title of host publicationProceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages384-388
    Number of pages5
    ISBN (Electronic)9784885523182
    DOIs
    Publication statusPublished - 8 Mar 2019
    Event15th International Symposium on Information Theory and Its Applications, ISITA 2018 - Singapore, Singapore
    Duration: 28 Oct 201831 Oct 2018

    Publication series

    NameProceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

    Conference

    Conference15th International Symposium on Information Theory and Its Applications, ISITA 2018
    Country/TerritorySingapore
    CitySingapore
    Period28/10/1831/10/18

    Fingerprint

    Dive into the research topics of 'On the Decoding Radius Realized by Low-Complexity Decoded Non-Binary Irregular LDPC Codes'. Together they form a unique fingerprint.

    Cite this