Searching for voltage graph-based LDPC tailbiting codes with large girth

Summary, in English

The relation between parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Using the principle of tailbiting, compact representations of bipartite graphs based on convolutional codes can be found.



Bounds on the girth and the minimum distance of LDPC block codes constructed in such a way are discussed. Algorithms for searching iteratively for LDPC block codes with large girth and for determining their minimum distance are presented. Constructions based on all-one matrices, Steiner Triple Systems, and QC block codes are introduced. Finally, new QC regular LDPC block codes with girth up to 24 are given.

• Author: Irina Bocharova; Florian Hug; Rolf Johannesson; Boris Kudryashov; Roman Satyukov
• Department/s: Department of Electrical and Information Technology
• Publishing year: 2012
• Language: English
• Pages: 2265-2279
• Publication/Series: IEEE Transactions on Information Theory
• Volume: 58
• Issue: 4
• Full text: - 352 kB; Download statistics
• Links: http://dx.doi.org/10.1109/TIT.2011.2176717
• Document type: Journal article
• Publisher: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Keywords: biadjacency matrix; convolutional code; girth; LDPC code; minimum distance; tailbiting; Tanner graph
• Status: Published
• Research group: Information Theory
• ISBN/ISSN/Other: ISSN: 0018-9448