Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth

Irina Bocharova; Florian Hug; Rolf Johannesson; Boris Kudryashov; Roman Satyukov

doi:10.1109/ISIT.2011.6034230

Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth

Irina Bocharova, Florian Hug, Rolf Johannesson, Boris Kudryashov, Roman Satyukov

Department of Electrical and Information Technology

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

175 Downloads (Pure)

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.

Original language	English
Title of host publication	[Host publication title missing]
DOIs	https://doi.org/10.1109/ISIT.2011.6034230
Publication status	Published - 2011
Event	IEEE International Symposium on Information Theory, 2011 - Saint Petersburg, Russian Federation Duration: 2011 Jul 31 → 2011 Aug 5

Conference

Conference	IEEE International Symposium on Information Theory, 2011
Abbreviated title	ISIT07
Country/Territory	Russian Federation
City	Saint Petersburg
Period	2011/07/31 → 2011/08/05

Subject classification (UKÄ)

Electrical Engineering, Electronic Engineering, Information Engineering

Access to Document

10.1109/ISIT.2011.6034230

some_voltage_ldpc

Cite this

@inproceedings{e746959c171549d09b2e2e6ba9c5cb11,

title = "Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth",

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.",

author = "Irina Bocharova and Florian Hug and Rolf Johannesson and Boris Kudryashov and Roman Satyukov",

year = "2011",

doi = "10.1109/ISIT.2011.6034230",

language = "English",

booktitle = "[Host publication title missing]",

note = "IEEE International Symposium on Information Theory, 2011, ISIT07 ; Conference date: 31-07-2011 Through 05-08-2011",

}

TY - GEN

T1 - Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth

AU - Bocharova, Irina

AU - Hug, Florian

AU - Johannesson, Rolf

AU - Kudryashov, Boris

AU - Satyukov, Roman

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT.2011.6034230

DO - 10.1109/ISIT.2011.6034230

M3 - Paper in conference proceeding

BT - [Host publication title missing]

T2 - IEEE International Symposium on Information Theory, 2011

Y2 - 31 July 2011 through 5 August 2011

ER -

Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth

Abstract

Conference

Subject classification (UKÄ)

Access to Document

Fingerprint

Cite this