Tree-based construction of LDPC codes

Deepak Sridhara; Christine Kelley; Joachim Rosenthal

doi:10.1109/ISIT.2005.1523456

Tree-based construction of LDPC codes

Deepak Sridhara, Christine Kelley, Joachim Rosenthal

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

We present a construction of LDPC codes that have minimum pseudocodeword weight equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on mutually orthogonal Latin squares to close the tree. Methods are presented for degrees d = p^s and d = p^s + 1, for p a prime, - one of which includes the well-known finite-geometry-based LDPC codes.

Original language	English (US)
Article number	1523456
Journal	IEEE International Symposium on Information Theory - Proceedings
Volume	2005-January
DOIs	https://doi.org/10.1109/ISIT.2005.1523456
State	Published - 2005
Externally published	Yes
Event	2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia Duration: Sep 4 2005 → Sep 9 2005

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2005.1523456

Cite this

@article{5e039351d9f04f5d9eb9a624849cb205,

title = "Tree-based construction of LDPC codes",

abstract = "We present a construction of LDPC codes that have minimum pseudocodeword weight equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on mutually orthogonal Latin squares to close the tree. Methods are presented for degrees d = ps and d = ps + 1, for p a prime, - one of which includes the well-known finite-geometry-based LDPC codes.",

author = "Deepak Sridhara and Christine Kelley and Joachim Rosenthal",

note = "Publisher Copyright: {\textcopyright} 2005 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.; 2005 IEEE International Symposium on Information Theory, ISIT 05 ; Conference date: 04-09-2005 Through 09-09-2005",

year = "2005",

doi = "10.1109/ISIT.2005.1523456",

language = "English (US)",

volume = "2005-January",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Tree-based construction of LDPC codes

AU - Sridhara, Deepak

AU - Kelley, Christine

AU - Rosenthal, Joachim

PY - 2005

Y1 - 2005

N2 - We present a construction of LDPC codes that have minimum pseudocodeword weight equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on mutually orthogonal Latin squares to close the tree. Methods are presented for degrees d = ps and d = ps + 1, for p a prime, - one of which includes the well-known finite-geometry-based LDPC codes.

AB - We present a construction of LDPC codes that have minimum pseudocodeword weight equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a d-regular tree for a fixed number of layers and employing a connection algorithm based on mutually orthogonal Latin squares to close the tree. Methods are presented for degrees d = ps and d = ps + 1, for p a prime, - one of which includes the well-known finite-geometry-based LDPC codes.

UR - http://www.scopus.com/inward/record.url?scp=38349119847&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38349119847&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2005.1523456

DO - 10.1109/ISIT.2005.1523456

M3 - Conference article

AN - SCOPUS:38349119847

SN - 2157-8095

VL - 2005-January

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

M1 - 1523456

T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05

Y2 - 4 September 2005 through 9 September 2005

ER -

Tree-based construction of LDPC codes

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this