IEEE Communications Letters

More on the Minimum Distance of Array LDPC Codes

Haiyang Liu, Shipei Yang, Gang Deng, Jie Chen

Published Apr 29, 2014• 5 citations

Abstract

Array low-density parity-check (LDPC) codes are a special class of quasi-cyclic LDPC codes constructed from a pair of integers (m, q), where q is an odd prime, and m ≤ q. In this paper, an improved upper bound on the minimum distance of this class of codes is given.

DOI: 10.1109/lcomm.2014.2320929

Related papers

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

Eirik Rosnes, Marcel Ambroze, Martin Tomlinson

In this work, we present an upper bound on the minimum distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m ≤ q. In the literature, the minimum distance of these codes (denoted by d(q,m)) has been thoroughly studied for m ≤ 5. Both exact results, for small values of q and m, and general (i.e., independent of q) bounds have been established. For m ≤ 6, the best known minimum distance upper bound, derived by Mittelholzer (IEEE Int. Symp. Inf. Theory, Jun./Jul. 2002), is d(q, 6) ≤ 32. In this work, we derive an improved upper bound of d(q, 6) ≤ 20 by using the concept of a template support matrix of a codeword. The bound is tight with high probability in the sense that we have not been able to find codewords of strictly lower weight for several values of q using a minimum distance probabilistic algorithm. Finally, we provide new specific minimum distance results for m ≤ 6 and low-to-moderate values of q ≤ 79.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20140 citations

On the Minimum/Stopping Distance of Array Low-Density Parity-Check Codes

Eirik Rosnes, Marcel Ambroze, Martin Tomlinson

In this paper, we study the minimum/stopping distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m q. In the literature, the minimum/stopping distance of these codes (denoted by d(q, m) and h(q, m), respectively) has been thoroughly studied for m 5. Both exact results, for small values of q and m, and general (i.e., independent of q) bounds have been established. For m = 6, the best known minimum distance upper bound, derived by Mittelholzer, is d(q, 6) 32. In this paper, we derive an improved upper bound of d(q, 6) 20 and a new upper bound d(q, 7) 24 by using the concept of a template support matrix of a codeword/stopping set. The bounds are tight with high probability in the sense that we have not been able to find codewords of strictly lower weight for several values of q using a minimum distance probabilistic algorithm. Finally, we provide new specific minimum/stopping distance results for m 7 and low-to-moderate values of q ≤79.

arXiv:1205.2590IEEE Transactions on Information TheoryJul 11, 201422 citations

1 On the Minimum/Stopping Distance of Array Low-Density Parity-Check Codes

Eirik Rosnes, Marcel Ambroze, Martin Tomlinson +1 more

In this work, we study the minimum/stopping distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m <= q. In the literature, the minimum/stopping distance of these codes (denoted by d(q,m) and h(q,m), respectively) has been thoroughly studied for m <= 5. Both exact results, for small values of q and m, and general (i.e., independent of q) bounds have been established. For m=6, the best known minimum distance upper bound, derived by Mittelholzer (IEEE Int. Symp. Inf. Theory, Jun./Jul. 2002), is d(q,6) <= 32. In this work, we derive an improved upper bound of d(q,6) <= 20 and a new upper bound d(q,7) <= 24 by using the concept of a template support matrix of a codeword/stopping set. The bounds are tight with high probability in the sense that we have not been able to find codewords of strictly lower weight for several values of q using a minimum distance probabilistic algorithm. Finally, we provide new specific minimum/stopping distance results for m <= 7 and low-to-moderate values of q <= 79.

Aug 17, 201625 citations

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

Eirik Rosnes

An array low-density parity-check (LDPC) code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m ≤ q. The exact minimum distance, for small q and m, has been calculated, and tight upper bounds on it for m ≤ 7 have been derived. In this work, we study the minimum distance of the spatially-coupled version of these codes. In particular, several tight upper bounds on the optimal minimum distance for coupling length at least two and m = 3; 4; 5, that are independent of q and that are valid for all values of q ≥ q0where q0depends on m, are presented. Furthermore, we show by exhaustive search that by carefully selecting the edge spreading or unwrapping procedure, the minimum distance (when q is not very large) can be significantly increased, especially for m = 5.

arXiv:1504.06416IEEE International Symposium on Information Theory (ISIT)Jun 1, 201510 citations

Further Results on the Stopping Distance of Array LDPC Matrices

Haiyang Liu, Lu HE, Jie Chen

Given an odd prime q and an integer m ≤ q, an array-based parity-check matrix H(m,q) can be constructed for a quasi-cyclic low-density parity-check (LDPC) code C(m,q). For m = 4 and q ≥ 11, we prove the stopping distance of H(4,q) is 10, which is equal to the minimum Hamming distance of the associated code C(4,q). In addition, a tighter lower bound on the stopping distance of H(m,q) is also given for m > 4 and q ≥ 11.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesJan 1, 20126 citations

Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited

Alexey Frolov, Pavel S. Rybin

Two upper bounds on the minimum distance of type-1 quasi-cyclic low-density parity-check (QC LDPC) codes are derived. The necessary condition is given for the minimum code distance of such codes to grow linearly with the code length.

arXiv:1401.2120Jan 9, 20140 citations