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 条
  • [41] On upper bounds for minimum distance and covering radius of non-binary codes
    Laihonen, Tero
    Litsyn, Simon
    Designs, Codes, and Cryptography, 1998, 14 (01): : 71 - 80
  • [42] Further upper bounds on the minimum distance for turbo codes using CPP interleavers
    Trifina, Lucian
    Tarniceriu, Daniela
    Ryu, Jonghoon
    Rotopanescu, Ana-Mirela
    PHYSICAL COMMUNICATION, 2020, 43
  • [43] Further upper bounds on the minimum distance for turbo codes using CPP interleavers
    Trifina, Lucian
    Tarniceriu, Daniela
    Ryu, Jonghoon
    Rotopanescu, Ana-Mirela
    Trifina, Lucian (luciant@etti.tuiasi.ro), 1600, Elsevier B.V., Netherlands (43):
  • [44] A Construction of LDPC Convolutional Codes with Close Distance Bounds
    Chen, Tien-Hui
    Chen, Kuan-Chen
    Lin, Mao-Chao
    2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA), 2014, : 90 - 94
  • [45] Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds
    Smarandache, Roxana
    Vontobel, Pascal O.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (02) : 585 - 607
  • [46] Bounds for the minimum distance function
    Nunez-Betancourt, Luis
    Pitones, Yuriko
    Villarreal, Rafael H.
    ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA, 2021, 29 (03): : 229 - 242
  • [47] Upper bounds on the rate of LDPC codes for a class of finite-state Markov channels
    Grover, Pulkit
    Chaturvedi, Ajit Kumar
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (02) : 794 - 804
  • [48] Quantum LDPC Codes With Almost Linear Minimum Distance
    Panteleev, Pavel
    Kalachev, Gleb
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (01) : 213 - 229
  • [49] Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
    Tillich, Jean-Pierre
    Zemor, Gilles
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (02) : 1193 - 1202
  • [50] On the Minimum Distance of Generalized Spatially Coupled LDPC Codes
    Mitchell, David G. M.
    Lentmaier, Michael
    Costello, Daniel J., Jr.
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1874 - +
12345