Tight bounds of minimum distance distributions of irregular LDPC code ensembles

被引：0

作者：

Miyamoto, Shinya ^{[1
]}

Kasai, Kenta ^{[1
]}

Shibuya, Tomoharu ^{[2
]}

Sakaniwa, Kohichi ^{[1
]}

机构：

[1] Tokyo Inst Technol, Dept Commun & Integrated Syst, Tokyo 1528552, Japan

[2] Natl Inst Multimedia Educ, R & D Dept, Chiba 2610014, Japan

来源：

2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7 | 2007年

关键词：

D O I：

10.1109/ISIT.2007.4557315

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Upper bounds of minimum distance distributions of Gallger codes and irregular LDPC codes were derived by Gallage and Di, respectively. Di's bounds are tight for irregular LDPC codes which have variable nodes of degree two, however, it is not tight for irregular LDPC codes which do not. In this paper, we derive tight lower and upper bounds of minimum distance distributions of irregular LDPC code ensembles without variable nodes of degree two.

引用

页码：756 / +

页数：2

共 50 条

[1] Minimum Distance Distribution of Irregular Generalized LDPC Code Ensembles
Mulholland, Ian P.
Flanagan, Mark F.
Paolini, Enrico
2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1670 - +
[2] Linear Programming Bounds on the Degree Distributions of LDPC Code Ensembles
Sason, Igal
2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 224 - 228
[3] Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes
Hashemi, Yoones
Banihashemi, Amir H.
IEEE COMMUNICATIONS LETTERS, 2018, 22 (01) : 33 - 36
[4] Minimum distance bounds of irregular QC-LDPC codes and their applications
Shin, MH
Kim, JS
Song, HY
2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 312 - 312
[5] Trapping Sets in Irregular LDPC Code Ensembles
Milenkovic, Olgica
Soljanin, Emina
Whiting, Philip
2006 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-12, 2006, : 1101 - 1106
[6] Minimum Distance Bounds for Multiple-Serially Concatenated Code Ensembles
Koller, Christian
Kliewer, Joerg
Zigangirov, Kamil S.
Costello, Daniel J., Jr.
2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 1888 - +
[7] Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensembles
Ikegaya, R
Kasai, K
Shibuya, T
Sakaniwa, K
2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 208 - 208
[8] Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensembles
Ikegaya, R
Kasai, K
Shibuya, T
Sakaniwa, K
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (10): : 2484 - 2492
[9] On the Design of Irregular LDPC Code Ensembles for BIAWGN Channels
Saeedi, Hamid
Banihashemi, Amir H.
IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (05) : 1376 - 1382
[10] Minimum Distance Lower Bounds for Girth-Constrained RA Code Ensembles
Chen, Weigang
Yin, Liuguo
Lu, Jianhua
IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (06) : 1623 - 1626

← 1 2 3 4 5 →