Searching for Voltage Graph-Based LDPC Tailbiting Codes with Large Girth

Autor:	Bocharova, Irina E., Hug, Florian, Johannesson, Rolf, Kudryashov, Boris D., Satyukov, Roman V.
Rok vydání:	2011
Předmět:	Computer Science - Information Theory
Druh dokumentu:	Working Paper
DOI:	10.1109/TIT.2011.2176717
Popis:	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-ones matrices, Steiner Triple Systems, and QC block codes are introduced. Finally, new QC regular LDPC block codes with girth up to 24 are given. Comment: Submitted to IEEE Transactions on Information Theory in February 2011
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1108.0840 Zobrazit plný text záznamu View this record from Arxiv