Title :
Some voltage graph-based LDPC tailbiting codes with large girth
Author :
Bocharova, Irina E. ; Hug, Florian ; Johannesson, Rolf ; Kudryashov, Boris D. ; Satyukov, Roman V.
Author_Institution :
Dept. of Inf. Syst., St. Petersburg Univ. of Inf. Technol., St. Petersburg, Russia
fDate :
July 31 2011-Aug. 5 2011
Abstract :
The relation between the parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and the biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Algorithms for searching iteratively for LDPC block codes with large girth are presented and constructions based on Steiner Triple Systems and short QC block codes are introduced, leading to new QC regular LDPC block codes with girth up to 24.
Keywords :
block codes; cyclic codes; iterative methods; matrix algebra; parity check codes; LDPC block codes; LDPC tailbiting codes; Steiner triple systems; biadjacency matrices; bipartite graphs; iterative searching; large girth; low-density parity-check codes; parity-check matrices; quasicyclic codes; short QC block codes; voltage graph; Bipartite graph; Block codes; Complexity theory; Convolutional codes; Iterative decoding; Sparse matrices;
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2011.6034230
