New low-density parity-check codes with large girth based on hypergraphs

Author

Bocharova, Irina E. ; Hug, Florian ; Johannesson, Rolf ; Kudryashov, Boris D. ; Satyukov, Roman V.

Author_Institution

Dept. of Inf. Syst., St. Petersburg State Univ. of Inf. Technol., Mech., & Opt., St. Petersburg, Russia

fYear

2010

fDate

13-18 June 2010

Firstpage

819

Lastpage

823

Abstract

The relation between low-density parity-check (LDPC) codes and hypergraphs supports searching for powerful LDPC codes based on hypergraphs. On the other hand, coding theory methods can be used in searching for hypergraphs with large girth. Moreover, compact representations of hypergraphs based on convolutional codes can be found. Algorithms for iteratively constructing LDPC codes with large girth and for determining their minimum distance are introduced. New quasi-cyclic (QC) LDPC codes are presented, some having both optimal girth and optimal minimum distance.

Keywords

convolutional codes; parity check codes; convolutional codes; girth; hypergraphs; low density parity check codes; quasicyclic LDPC codes; Belief propagation; Convolutional codes; Hydrogen; Information systems; Information technology; Iterative algorithms; Iterative decoding; Linear code; Parity check codes; Polynomials;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on

Conference_Location

Austin, TX

Print_ISBN

978-1-4244-7890-3

Electronic_ISBN

978-1-4244-7891-0

Type

conf

DOI

10.1109/ISIT.2010.5513639

Filename

5513639