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 条
  • [1] On achievable rates and complexity of LDPC codes over parallel channels: Bounds and applications
    Sason, Igal
    Wiechman, Gil
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (02) : 580 - 598
  • [2] Bounds on achievable rates of LDPC codes used over the binary erasure channel
    Barak, H
    Burshtein, D
    Feder, M
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) : 2483 - 2489
  • [3] Upper bounds on the rate of LDPC codes
    Burshtein, D
    Krivelevich, M
    Litsyn, S
    Miller, G
    [J]. 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
    [J]. ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 28 - 28
  • [5] On achievable rates and complexity of LDPC codes for parallel channels: Information-theoretic bounds and applications
    Sason, Igal
    Wiechman, Gil
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 406 - +
  • [6] Asymptotic MAP upper bounds for LDPC codes
    Matas, David
    Lamarca, Meritxell
    [J]. 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 2893 - 2897
  • [7] Achievable Rates and Upper bounds for the Interference Relay Channel
    Chaaban, Anas
    Sezgin, Aydin
    [J]. 2010 CONFERENCE RECORD OF THE FORTY FOURTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2010, : 267 - 271
  • [8] LOWER BOUNDS ON ACHIEVABLE RATES FOR LIMITED BITSHIFT CORRECTING CODES
    KOLESNIK, VD
    KRACHKOVSKY, VY
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (05) : 1443 - 1458
  • [9] On achievable rates and complexity of LDPC codes over parallel channels: Bounds and applications (vol 53, pg 580, 2007)
    Sason, Igal
    Wiechman, Gil
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (07) : 3368 - 3368
  • [10] Upper bounds on the rate of LDPC codes as a function of minimum distance
    Ben-Haim, Y
    Litsyn, S
    [J]. 2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 47 - 51
12345