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

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 elim...

Full description

Saved in:
Bibliographic Details
Published in:Journal of communications technology & electronics 2018-12, Vol.63 (12), p.1524-1529
Main Authors: Kruglik, S. A., Potapova, V. S., Frolov, A. A.
Format: Article
Language:English
Subjects:
Algorithms
Analysis
Binary system
Codes
Communications Engineering
Computer simulation
Data Transmission in Computer Networks
Engineering
Error correcting codes
Information management
Low density parity check codes
Methods
Networks
Parity
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1064-2269
1555-6557
DOI:10.1134/S1064226918120112