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

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. ◽

10.1109/isit.2005.1523290 ◽

2005 ◽

Author(s):

Y. Ben-Haim ◽

S. Litsyn

Keyword(s):

Minimum Distance ◽

Download Full-text

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

IEEE Transactions on Information Theory ◽

10.1109/tit.2018.2879823 ◽

2019 ◽

Vol 65 (4) ◽

pp. 2062-2074 ◽

Author(s):

Ali Dehghan ◽

Amir H. Banihashemi

Keyword(s):

Minimum Distance ◽

Upper Bounds ◽

Minimum Size ◽

Download Full-text

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

IEEE Transactions on Information Theory ◽

10.1109/tit.2006.872972 ◽

2006 ◽

Vol 52 (5) ◽

pp. 2092-2100 ◽

Author(s):

Y. Ben-Haim ◽

S. Litsyn

Keyword(s):

Minimum Distance ◽

Download Full-text

Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes

IEEE Communications Letters ◽

10.1109/lcomm.2017.2767028 ◽

2018 ◽

Vol 22 (1) ◽

pp. 33-36 ◽

Author(s):

Yoones Hashemi ◽

Amir H. Banihashemi

Keyword(s):

Minimum Distance ◽

Upper Bounds ◽

Lower And Upper Bounds

Download Full-text

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

2018 IEEE International Symposium on Information Theory (ISIT) ◽

10.1109/isit.2018.8437465 ◽

2018 ◽

Author(s):

Ali Dehghan ◽

Amir H. Banihashemi

Keyword(s):

Minimum Distance ◽

Upper Bounds ◽

New Technique ◽

Minimum Size ◽

Trapping Sets ◽

A New Technique

Download Full-text

On the Minimum Distance of Generalized LDPC Codes

2007 IEEE International Symposium on Information Theory ◽

10.1109/isit.2007.4557106 ◽

2007 ◽

Author(s):

Ayoub Otmani ◽

Jean-Pierre Tillich ◽

Iryna Andriyanova

Keyword(s):

Minimum Distance ◽

Download Full-text

Upper bounds on the cardinality of a binary code with a given minimum distance

Information and Control ◽

10.1016/s0019-9958(75)90310-1 ◽

1975 ◽

Vol 28 (4) ◽

pp. 292-303 ◽

Author(s):

V.M. Sidelnikov

Keyword(s):

Minimum Distance ◽

Binary Code ◽

Download Full-text

Upper bounds on the rate of LDPC codes

Proceedings IEEE International Symposium on Information Theory, ◽

10.1109/isit.2002.1023300 ◽

2003 ◽

Author(s):

D. Burshtein ◽

M. Krivelevich ◽

S. Litsyn ◽

G. Miller

Keyword(s):

Download Full-text

Upper bounds for fixed-weight codes of specified minimum distance (Corresp.)

IEEE Transactions on Information Theory ◽

10.1109/tit.1964.1053677 ◽

1964 ◽

Vol 10 (3) ◽

pp. 246-248 ◽

Author(s):

C. Freiman

Keyword(s):

Minimum Distance ◽

Upper Bounds ◽

Download Full-text

Upper bounds on the rate of LDPC codes

IEEE Transactions on Information Theory ◽

10.1109/tit.2002.801408 ◽

2002 ◽

Vol 48 (9) ◽

pp. 2437-2449 ◽

Author(s):

D. Burshtein ◽

M. Krivelevich ◽

S. Litsyn ◽

G. Miller

Keyword(s):

Download Full-text

Upper Bounds on the Minimum Distance of Trellis Codes

Bell System Technical Journal ◽

10.1002/j.1538-7305.1983.tb03197.x ◽

1983 ◽

Vol 62 (8) ◽

pp. 2617-2646 ◽

Author(s):

A. R. Calderbank ◽

J. E. Mazo ◽

H. M. Shapiro

Keyword(s):

Minimum Distance ◽

Upper Bounds ◽

Download Full-text