Searching for voltage graph-based LDPC tailbiting codes with large girth
(2012) In IEEE Transactions on Information Theory 58(4). p.2265-2279- Abstract
- 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-one matrices, Steiner Triple Systems, and QC block codes are introduced. Finally, new QC regular LDPC block codes with girth up to 24 are given.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/2173179
- author
- Bocharova, Irina LU ; Hug, Florian LU ; Johannesson, Rolf LU ; Kudryashov, Boris LU and Satyukov, Roman
- organization
- publishing date
- 2012
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- biadjacency matrix, convolutional code, girth, LDPC code, minimum distance, tailbiting, Tanner graph
- in
- IEEE Transactions on Information Theory
- volume
- 58
- issue
- 4
- pages
- 2265 - 2279
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- wos:000302079800019
- scopus:84858956590
- ISSN
- 0018-9448
- DOI
- 10.1109/TIT.2011.2176717
- language
- English
- LU publication?
- yes
- id
- 3ecb525c-2622-4032-994c-8ad35a4b85ca (old id 2173179)
- date added to LUP
- 2016-04-01 14:47:17
- date last changed
- 2022-01-28 02:31:19
@article{3ecb525c-2622-4032-994c-8ad35a4b85ca, abstract = {{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.<br/><br> <br/><br> 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-one matrices, Steiner Triple Systems, and QC block codes are introduced. Finally, new QC regular LDPC block codes with girth up to 24 are given.}}, author = {{Bocharova, Irina and Hug, Florian and Johannesson, Rolf and Kudryashov, Boris and Satyukov, Roman}}, issn = {{0018-9448}}, keywords = {{biadjacency matrix; convolutional code; girth; LDPC code; minimum distance; tailbiting; Tanner graph}}, language = {{eng}}, number = {{4}}, pages = {{2265--2279}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, series = {{IEEE Transactions on Information Theory}}, title = {{Searching for voltage graph-based LDPC tailbiting codes with large girth}}, url = {{https://lup.lub.lu.se/search/files/4166503/2173180.pdf}}, doi = {{10.1109/TIT.2011.2176717}}, volume = {{58}}, year = {{2012}}, }