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 条
  • [1] Upper bounds on the rate of LDPC codes as a function of minimum distance
    Ben-Haim, Y
    Litsyn, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) : 2092 - 2100
  • [2] 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
  • [3] Upper bounds on the rate of LDPC codes
    Burshtein, D
    Krivelevich, M
    Litsyn, S
    Miller, G
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (09) : 2437 - 2449
  • [4] Upper bounds on the rate of LDPC codes
    Burshtein, D
    Krivelevich, M
    Litsyn, S
    Miller, G
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 28 - 28
  • [5] Upper bounds on the minimum distance of spherical codes
    Boyvalenkov, PG
    Danev, DP
    Bumova, SP
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (05) : 1576 - 1581
  • [6] Generalization of Tanner's minimum distance bounds for LDPC codes
    Shin, Min-Ho
    Kim, Joon-Sung
    Song, Hong-Yeop
    IEEE Commun Lett, 3 (240-242):
  • [7] Generalization of Tanner's minimum distance bounds for LDPC codes
    Shin, MH
    Kim, JS
    Song, HY
    IEEE COMMUNICATIONS LETTERS, 2005, 9 (03) : 240 - 242
  • [8] Bounds on the Rate and Minimum Distance of Codes with Availability
    Balaji, S. B.
    Kumar, P. Vijay
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017,
  • [9] UPPER BOUNDS ON THE MINIMUM DISTANCE OF TRELLIS CODES.
    Calderbank, A.R.
    Mazo, J.E.
    Shapiro, H.M.
    The Bell System technical journal, 1983, 62 (8 pt 1): : 2617 - 2646
  • [10] Upper and Lower Bounds on the Minimum Distance of Expander Codes
    Frolov, Alexey
    Zyablov, Victor
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 1397 - 1401
12345