New low-density parity-check codes with large girth based on hypergraphs
Author
Summary, in English
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 girths and for determining their minimum distances are introduced. New quasi-cyclic (QC) LDPC codes are presented, some having both optimal girth and optimal minimum distance.
Publishing year
2010
Language
English
Publication/Series
[Host publication title missing]
Full text
- Available as PDF - 442 kB
- Download statistics
Document type
Conference paper
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Conference name
IEEE International Symposium on Information Theory (ISIT), 2010
Conference date
2010-06-13 - 2010-06-18
Conference place
Austin, Texas, United States
Status
Published
Research group
- Information Theory