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 条

[31] Bounds for the minimum distance and covering radius of orthogonal arrays via their distance distributions
Boumova, Silvia
Boyvalenkov, Peter
Stoyanova, Maya
2022 10TH INTERNATIONAL WORKSHOP ON SIGNAL DESIGN AND ITS APPLICATIONS IN COMMUNICATIONS (IWSDA), 2022, : 185 - 189
[32] On Concentration of Measures for LDPC Code Ensembles
Sason, Igal
Eshel, Ronen
2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 1268 - 1272
[33] Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance
Burshtein, David
Goldenberg, Idan
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (11) : 7386 - 7402
[34] Weight and stopping set distributions of two-edge type LDPC code ensembles
Ikegaya, R
Kasai, K
Shimoyama, Y
Shibuya, T
Sakaniwa, K
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (10): : 2745 - 2761
[35] On the Design of a Superior Irregular LDPC Code
Mataracioglu, Tolga
Aygoelue, Uemit
2008 IEEE 16TH SIGNAL PROCESSING, COMMUNICATION AND APPLICATIONS CONFERENCE, VOLS 1 AND 2, 2008, : 6 - +
[36] Sufficient conditions for a regular LDPC code better than an irregular LDPC code
Miyamoto, Shinya
Kasai, Kenta
Sakaniwa, Kohichi
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2007, E90A (02) : 531 - 534
[37] Distance properties of irregular LDPC codes
Lehmann, F
2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 85 - 85
[38] The block error probability of detailedly represented irregular LDPC code ensembles under maximum likelihood decoding
Ikegaya, Ryoji
Kasai, Kenta
Shibuya, Tomoharu
Sakaniwa, Kohichi
2006 IEEE INFORMATION THEORY WORKSHOP, 2006, : 317 - +
[39] Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
Frolov, A. A.
Zyablov, V. V.
PROBLEMS OF INFORMATION TRANSMISSION, 2011, 47 (04) : 327 - 341
[40] Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
A. A. Frolov
V. V. Zyablov
Problems of Information Transmission, 2011, 47 : 327 - 341

← 1 2 3 4 5 →