LDPC codes which can correct three errors under iterative decoding

被引：7

作者：

Chilappagari, Shashi Kiran ^{[1
]}

Krishnan, Anantha Raman ^{[1
]}

Vasic, Bane ^{[2
]}

机构：

[1] Univ Arizona, Dept Elect & Comp Engn, Tucson, AZ 85721 USA

[2] Univ Arizona, Dept Math, Tucson, AZ 85721 USA

来源：

2008 IEEE INFORMATION THEORY WORKSHOP | 2008年

关键词：

D O I：

10.1109/ITW.2008.4578696

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, we provide necessary and sufficient conditions for a column-weight-three LDPC code to correct all patterns up to three errors when decoded using Gallager A algorithm. We then provide a construction technique which results in a code satisfying the above conditions. We also provide numerical assessment of code performance via simulation results.

引用

页码：406 / +

页数：2

共 19 条

[1]

[Anonymous], P IEEE INT C COMM IS

[2]

[Anonymous], GRAPH COVER DECODING

[3]

[Anonymous], ELECT NOTES THEORETI

[4] Expander graph arguments for message-passing algorithms [J].

Burshtein, D ;

Miller, G .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :782-790

[5]

CHILAPPAGARI SK, LDPC CODES WHI UNPUB

[6]

CHILAPPAGARI SK, IEEE T INFORM UNPUB

[7]

Di CY, 2002, IEEE T INFORM THEORY, V48, P1570, DOI 10.1109/TIT.2002.1003839

[8]

Gallager RG, 1963, LOW DENSITY PARITY C

[9] Regular and irregular progressive edge-growth tanner graphs [J].

Hu, XY ;

Eleftheriou, E ;

Arnold, DM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (01) :386-398

[10] Designing LDPC codes without small trapping sets by using tanner graph covers [J].

Ivkovic, Milos ;

Chilappagari, Shashi Kiran ;

Vasic, Bane .

2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, :2266-+

← 1 2 →