In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). The comparison to the lower bound for LDPC codes over GF(q) ...

May 8, 2016 · In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). A comparison with the lower bound for LDPC ...

Feb 24, 2015 · In this section we obtain the upper bound on the minimum distance of generalized LDPC codes. We use Elias–Bassalygo type arguments [6]. Let us ...

Apr 1, 2015 · In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). The comparison to the lower bound for LDPC ...

Abstract—In [1] a syndrome counting based upper bound on the minimum distance of regular binary LDPC codes is given. In this paper we extend the bound to ...

The new bound is shown to lie under the Gilbert-Varshamov bound at high rates and to compare to the lower bound for LDPC codes over GF(q) and to the upper ...

In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). A comparison with the lower bound for LDPC codes over GF(q), ...

Jul 1, 2019 · Some codes are quasi-cylic (QC-LDPC) and cylic (C-LDPC), and are supposed to have "good" minimum distance, but they only scale to √n at most.

In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). A comparison with the lower bound for LDPC codes over GF(q), ...

Abstract: The minimum distance of expander codes over GF(q) is studied. A new upper bound on the minimum distance of expander codes is derived.