On Upper Bounds for the Achievable Rates of LDPC Codes

被引：0
|
作者：
Presman, Noam [1 ]
Litsyn, Simon [1 ]
机构：
[1] Tel Aviv Univ, Sch Elect Engn, IL-69978 Tel Aviv, Israel
来源：
2009 IEEE INFORMATION THEORY WORKSHOP (ITW 2009) | 2009年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Upper bounds on the mutual entropy of syndrome components of low-density parity-check (LDPC) codes are developed. Using these bounds, an upper bound is derived on the rates of LDPC codes for which reliable communication over a memoryless binary-input symmetric-output (MBIOS) channel is achievable. This bound improves on the earlier known bounds due to Gallager, Burshtein et al., and Weichmann-Sason.
引用
收藏
页码：21 / 25
页数：5
相关论文
共 50 条
  • [41] Improved upper bounds on sizes of codes
    Mounits, B
    Etzion, T
    Litsyn, S
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (04) : 880 - 886
  • [42] Optimal Achievable Rates for Interference Networks With Random Codes
    Bandemer, Bernd
    El Gamal, Abbas
    Kim, Young-Han
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (12) : 6536 - 6549
  • [43] Optimal Achievable Rates for Computation With Random Homologous Codes
    Sen, Pinar
    Lim, Sung Hoon
    Kim, Young-Han
    [J]. 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2351 - 2355
  • [44] UPPER BOUNDS ON MIXING RATES
    Lieb, Elliott H.
    Vershynina, Anna
    [J]. QUANTUM INFORMATION & COMPUTATION, 2013, 13 (11-12) : 986 - 994
  • [45] Upper bounds on coarsening rates
    Kohn, RV
    Otto, F
    [J]. COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2002, 229 (03) : 375 - 395
  • [46] Upper Bounds on Coarsening Rates
    Robert V. Kohn
    Felix Otto
    [J]. Communications in Mathematical Physics, 2002, 229 : 375 - 395
  • [47] Generalization of Tanner's minimum distance bounds for LDPC codes
    Shin, Min-Ho
    Kim, Joon-Sung
    Song, Hong-Yeop
    [J]. IEEE Commun Lett, 3 (240-242):
  • [48] Optimal code rates for the Lorentzian channel: Shannon codes and LDPC codes
    Ryan, WE
    Wang, F
    Wood, R
    Li, Y
    [J]. IEEE TRANSACTIONS ON MAGNETICS, 2004, 40 (06) : 3559 - 3565
  • [49] Sharp bounds for MAP decoding of general irregular LDPC codes
    Kudekar, Shrinivas
    Macris, Nicolas
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 2259 - +
  • [50] Generalization of Tanner's minimum distance bounds for LDPC codes
    Shin, MH
    Kim, JS
    Song, HY
    [J]. IEEE COMMUNICATIONS LETTERS, 2005, 9 (03) : 240 - 242
12345