On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices

Problems of Information Transmission ◽

10.1007/s11122-005-0008-4 ◽

2005 ◽

Vol 41 (1) ◽

pp. 33-44 ◽

Author(s):

A. Sridharan ◽

M. Lentmaier ◽

D. V. Truhachev ◽

D. J. Costello ◽

K. Sh. Zigangirov

Keyword(s):

Minimum Distance ◽

Low Density ◽

Parity Check ◽

Permutation Matrices ◽

Low Density Parity Check ◽

Parity Check Codes

Download Full-text

Approximate algorithms for computing the minimum distance of low-density parity-check codes

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. ◽

10.1109/isit.2004.1365512 ◽

2004 ◽

Author(s):

Xiao-Yu Hu ◽

M.P.C. Fossorier ◽

E. Eleftheriou

Keyword(s):

Minimum Distance ◽

Low Density ◽

Approximate Algorithms ◽

Parity Check ◽

Low Density Parity Check ◽

Parity Check Codes

Download Full-text

A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices

Problems of Information Transmission ◽

10.1134/s0032946017030048 ◽

2017 ◽

Vol 53 (3) ◽

pp. 229-241

Author(s):

F. I. Ivanov

Keyword(s):

Special Class ◽

Low Density ◽

Parity Check ◽

Permutation Matrices ◽

Low Density Parity Check ◽

Parity Check Codes

Download Full-text

Performance of low-density parity-check codes with linear minimum distance

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. ◽

10.1109/isit.2004.1365245 ◽

2004 ◽

Author(s):

H. Pishro-Nik ◽

F. Fekri

Keyword(s):

Minimum Distance ◽

Low Density ◽

Parity Check ◽

Low Density Parity Check ◽

Parity Check Codes

Download Full-text

Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices

IEEE Transactions on Information Theory ◽

10.1109/tit.2004.831841 ◽

2004 ◽

Vol 50 (8) ◽

pp. 1788-1793 ◽

Author(s):

M.P.C. Fossorier

Keyword(s):

Low Density ◽

Parity Check ◽

Permutation Matrices ◽

Low Density Parity Check ◽

Parity Check Codes

Download Full-text

On the computation of the minimum distance of low-density parity-check codes

2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577) ◽

10.1109/icc.2004.1312605 ◽

2004 ◽

Author(s):

Xiao-Yu Hu ◽

M.P.C. Fossorier ◽

E. Eleftheriou

Keyword(s):

Minimum Distance ◽

Low Density ◽

Parity Check ◽

Low Density Parity Check ◽

Parity Check Codes

Download Full-text

Comment on "Quasi-Cyclic Low Density Parity Check Codes From Circulant Permutation Matrices"

IEEE Transactions on Information Theory ◽

10.1109/tit.2008.2011508 ◽

2009 ◽

Vol 55 (3) ◽

pp. 1430-1430 ◽

Author(s):

M. Hagiwara ◽

M. Fossorier

Keyword(s):

Low Density ◽

Parity Check ◽

Permutation Matrices ◽

Low Density Parity Check ◽

Parity Check Codes

Download Full-text

High-performance binary and non-binary Low-density parity-check codes based on affine permutation matrices

IET Communications ◽

10.1049/iet-com.2014.1231 ◽

2015 ◽

Vol 9 (17) ◽

pp. 2114-2123 ◽

Author(s):

Mohammad Gholami ◽

Masoumeh Alinia

Keyword(s):

High Performance ◽

Low Density ◽

Parity Check ◽

Permutation Matrices ◽

Low Density Parity Check ◽

Parity Check Codes

Download Full-text

Performance of low-density parity-check codes with linear minimum distance

IEEE Transactions on Information Theory ◽

10.1109/tit.2005.860439 ◽

2006 ◽

Vol 52 (1) ◽

pp. 292-300 ◽

Author(s):

H. Pishro-Nik ◽

F. Fekri

Keyword(s):

Minimum Distance ◽

Low Density ◽

Parity Check ◽

Low Density Parity Check ◽

Parity Check Codes

Download Full-text

On the minimum distance of array-based spatially-coupled low-density parity-check codes

2015 IEEE International Symposium on Information Theory (ISIT) ◽

10.1109/isit.2015.7282582 ◽

2015 ◽

Author(s):

Eirik Rosnes

Keyword(s):

Minimum Distance ◽

Low Density ◽

Parity Check ◽

Low Density Parity Check ◽

Parity Check Codes

Download Full-text

An upper bound on the minimum distance of array low-density parity-check codes

2014 IEEE International Symposium on Information Theory ◽

10.1109/isit.2014.6875416 ◽

2014 ◽

Author(s):

Eirik Rosnes ◽

Marcel Adrian Ambroze ◽

Martin Tomlinson

Keyword(s):

Upper Bound ◽

Minimum Distance ◽

Low Density ◽

Parity Check ◽

Low Density Parity Check ◽

Parity Check Codes

Download Full-text