Upper bounds on the rate of LDPC codes as a function of minimum distance

被引：0
|
作者：
Ben-Haim, Y [1 ]
Litsyn, S [1 ]
机构：
[1] Tel Aviv Univ, Sch Elect Engn, IL-69978 Tel Aviv, Israel
来源：
2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2 | 2005年
关键词：
D O I：
暂无
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
New upper bounds on the rate of low-density parity-check (LDPC) codes as a function of the minimum distance of the code are derived. These bounds are based on combinatorial arguments and linear programming. They improve on the previous bounds due to Burshtein et al. It is proved that at least for high rates LDPC codes have worse relative minimum distance than the one guaranteed by the Gilbert-Varshamov bound.
引用
收藏
页码：47 / 51
页数：5
相关论文
共 50 条
  • [21] 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 - +
  • [22] Upper bounds on the rate of LDPC codes for Gilbert-Elliott channels
    Grover, P
    Chaturvedi, AK
    2004 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, 2004, : 230 - 235
  • [23] FURTHER ASYMPTOTIC UPPER-BOUNDS ON THE MINIMUM DISTANCE OF TRELLIS CODES
    POTTIE, GJ
    CALDERBANK, AR
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) : 1428 - 1431
  • [24] Upper bounds on the minimum distance for turbo codes using CPP interleavers
    Lucian Trifina
    Daniela Tarniceriu
    Jonghoon Ryu
    Ana-Mirela Rotopanescu
    Telecommunication Systems, 2021, 76 : 423 - 447
  • [25] Upper bounds on the minimum distance for turbo codes using CPP interleavers
    Trifina, Lucian
    Tarniceriu, Daniela
    Ryu, Jonghoon
    Rotopanescu, Ana-Mirela
    TELECOMMUNICATION SYSTEMS, 2021, 76 (03) : 423 - 447
  • [26] Distance bounds for an ensemble of LDPC convolutional codes
    Sridharan, Arvind
    Truhachev, Dmitri
    Lentmaier, Michael
    Costello, Daniel J., Jr.
    Zigangirov, Kamil Sh.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (12) : 4537 - 4555
  • [27] From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes
    Dehghan, Ali
    Banihashemi, Amir H.
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 1640 - 1644
  • [28] From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes
    Dehghan, Ali
    Banihashemi, Amir H.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (04) : 2062 - 2074
  • [29] Asymptotic MAP upper bounds for LDPC codes
    Matas, David
    Lamarca, Meritxell
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 2893 - 2897
  • [30] On Upper Bounds for the Achievable Rates of LDPC Codes
    Presman, Noam
    Litsyn, Simon
    2009 IEEE INFORMATION THEORY WORKSHOP (ITW 2009), 2009, : 21 - 25
12345