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 条
  • [41] Distance distributions in ensembles of irregular low-density parity-check codes
    Litsyn, S
    Shevelev, V
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (12) : 3140 - 3159
  • [42] Weight Distributions of Non-Binary Multi-Edge Type LDPC Code Ensembles
    Garrammone, Giuliano
    Declercq, David
    Fossorier, Marc P. C.
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2875 - 2879
  • [43] Stopping set distribution of LDPC code ensembles
    Orlitsky, A
    Viswanathan, K
    Zhang, JN
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 123 - 123
  • [44] Stopping set distribution of LDPC code ensembles
    Orlitsky, A
    Viswanathan, K
    Zhang, JN
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) : 929 - 953
  • [45] SOME LOWER BOUNDS ON NUMBER OF CODE POINTS IN A MINIMUM DISTANCE BINARY CODE .1.
    BAMBAH, RP
    JOSHI, DD
    LUTHAR, IS
    INFORMATION AND CONTROL, 1961, 4 (04): : 313 - &
  • [46] Improved Minimum Weight, Girth, and ACE Distributions in Ensembles of Short Block Length Irregular LDPC Codes Constructed using PEG and Cyclic PEG (CPEG) Algorithms
    Abdu-Aguye, Umar-Faruk
    Ambroze, Marcel Adrian
    Tomlinson, Martin
    2016 9TH INTERNATIONAL SYMPOSIUM ON TURBO CODES AND ITERATIVE INFORMATION PROCESSING (ISTC), 2016, : 186 - 190
  • [47] Irregular LDPC code and encoder/decoder research
    Institute of Image Communication and Information Processing, Shanghai Jiaotong University, Shanghai 200235, China
    Jisuanji Gongcheng, 2006, 21 (243-246):
  • [48] Analysis of an algorithm for irregular LDPC code construction
    Ramamoorthy, A
    Wesel, RD
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 69 - 69
  • [49] Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles
    Dehghan, Ali
    Banihashemi, Amir H.
    PROCEEDINGS OF 2018 IEEE 10TH INTERNATIONAL SYMPOSIUM ON TURBO CODES & ITERATIVE INFORMATION PROCESSING (ISTC), 2018,
  • [50] On the minimum distance of generalized LDPC codes
    Otmani, Ayoub
    Tillich, Jean-Pierre
    Andriyanova, Iryna
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 751 - +
12345