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

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

    Результат исследований: Вклад в журналСтатьярецензирование

    Аннотация

    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.

    Язык оригиналаАнглийский
    Страницы (с-по)1524-1529
    Число страниц6
    ЖурналJournal of Communications Technology and Electronics
    Том63
    Номер выпуска12
    DOI
    СостояниеОпубликовано - 1 дек. 2018

    Fingerprint

    Подробные сведения о темах исследования «A Method for Constructing Parity-Check Matrices of Quasi-Cyclic LDPC Codes Over GF(q)». Вместе они формируют уникальный семантический отпечаток (fingerprint).

    Цитировать