A Method for Constructing Parity-Check Matrices of Quasi-Cyclic LDPC Codes Over GF(q)

S. A. Kruglik, V. S. Potapova, A. A. Frolov

    Research output: Contribution to journalArticlepeer-review

    Abstract

    Abstract: An algorithm for constructing parity-check matrices of non-binary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base matrix and tries to eliminate them by selecting the circulants and the elements of GF(q). The algorithm tries to eliminate the cycles with the smallest number edges going outside the cycle. The efficiency of the algorithm is demonstrated by means of simulations. In order to explain the simulation results we also derive upper bounds on the minimum distance of NB QC-LDPC codes.

    Original languageEnglish
    Pages (from-to)1524-1529
    Number of pages6
    JournalJournal of Communications Technology and Electronics
    Volume63
    Issue number12
    DOIs
    Publication statusPublished - 1 Dec 2018

    Keywords

    • cycle
    • Galois field
    • iterative decoding threshold
    • LDPC code
    • parity-check matrix
    • Tanner graph

    Fingerprint

    Dive into the research topics of 'A Method for Constructing Parity-Check Matrices of Quasi-Cyclic LDPC Codes Over GF(q)'. Together they form a unique fingerprint.

    Cite this