The non-binary weight distribution and its spectral shape is developed for a partially-structured ensemble of low-density parity-check codes over finite fields. The ensemble is characterized by all degree-2 variable nodes and some of the degree-3 variable nodes being separated. It is shown that, under node separation, the typical minimum distance is strictly positive and significantly higher than the one of the corresponding unstructured ensemble
An ensemble of $(J,K)$ -regular low-density parity- check (LDPC) convolutional codes is introduced a...
An ensemble of codes defined by parity-check matrices composed of M ´ M permutation matrices is cons...
International audienceThis paper is the first part of an investigation if the capacity of a binary-i...
In this letter, an analytical method for evaluating the weight spectral shape of a nonbinary protogr...
The non-binary codeword weight distribution and its growth rate are developed for non-binary multi-...
Non-binary multi-edge type ensembles of lowdensity parity-check codes are analyzed in terms of non-b...
The code design of non-binary low-density parity-check codes for the erasure channel, under maximum ...
none3siIn this paper, the minimum distance distribution of irregular generalized LDPC (GLDPC) code e...
We introduce and analyze a new statistical ensemble of lowdensity parity-check convolutional (LDC) c...
ABSTRACT. Minimum distance is an important parameter of a linear error correcting code. For improved...
Recently LDPC codes with projected graph, or protograph structures have been proposed. In this paper...
International audienceThis paper continues a previous work on non-binary cluster-LDPC codes. Such co...
An ensemble of (J, K) -regular low-density parity-check (LDPC) convolutional codes is introduced and...
The finite-length absorbing set enumerators for non-binary protograph based low-density parity-check...
This paper considers low-density parity-check (LDPC) codes defined over non-binary, finite fields GF...
An ensemble of $(J,K)$ -regular low-density parity- check (LDPC) convolutional codes is introduced a...
An ensemble of codes defined by parity-check matrices composed of M ´ M permutation matrices is cons...
International audienceThis paper is the first part of an investigation if the capacity of a binary-i...
In this letter, an analytical method for evaluating the weight spectral shape of a nonbinary protogr...
The non-binary codeword weight distribution and its growth rate are developed for non-binary multi-...
Non-binary multi-edge type ensembles of lowdensity parity-check codes are analyzed in terms of non-b...
The code design of non-binary low-density parity-check codes for the erasure channel, under maximum ...
none3siIn this paper, the minimum distance distribution of irregular generalized LDPC (GLDPC) code e...
We introduce and analyze a new statistical ensemble of lowdensity parity-check convolutional (LDC) c...
ABSTRACT. Minimum distance is an important parameter of a linear error correcting code. For improved...
Recently LDPC codes with projected graph, or protograph structures have been proposed. In this paper...
International audienceThis paper continues a previous work on non-binary cluster-LDPC codes. Such co...
An ensemble of (J, K) -regular low-density parity-check (LDPC) convolutional codes is introduced and...
The finite-length absorbing set enumerators for non-binary protograph based low-density parity-check...
This paper considers low-density parity-check (LDPC) codes defined over non-binary, finite fields GF...
An ensemble of $(J,K)$ -regular low-density parity- check (LDPC) convolutional codes is introduced a...
An ensemble of codes defined by parity-check matrices composed of M ´ M permutation matrices is cons...
International audienceThis paper is the first part of an investigation if the capacity of a binary-i...