New low-density parity-check codes with large girth based on hypergraphs
(2010) IEEE International Symposium on Information Theory (ISIT), 2010- 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 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1581346
- author
- Bocharova, Irina LU ; Hug, Florian LU ; Johannesson, Rolf LU ; Kudryashov, Boris LU and Satyukov, Roman
- organization
- publishing date
- 2010
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- [Host publication title missing]
- pages
- 5 pages
- conference name
- IEEE International Symposium on Information Theory (ISIT), 2010
- conference location
- Austin, Texas, United States
- conference dates
- 2010-06-13 - 2010-06-18
- external identifiers
-
- scopus:77955699261
- DOI
- 10.1109/ISIT.2010.5513639
- language
- English
- LU publication?
- yes
- id
- 720b8ab7-7312-40d8-83b3-9cbaef4b224f (old id 1581346)
- date added to LUP
- 2016-04-04 14:18:21
- date last changed
- 2022-01-30 01:44:59
@inproceedings{720b8ab7-7312-40d8-83b3-9cbaef4b224f, 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 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.}}, author = {{Bocharova, Irina and Hug, Florian and Johannesson, Rolf and Kudryashov, Boris and Satyukov, Roman}}, booktitle = {{[Host publication title missing]}}, language = {{eng}}, title = {{New low-density parity-check codes with large girth based on hypergraphs}}, url = {{https://lup.lub.lu.se/search/files/6329564/1613918.pdf}}, doi = {{10.1109/ISIT.2010.5513639}}, year = {{2010}}, }