Add to ORKGThe problem of finding code distance has been long studied for the generic ensembles of linear codes and led to several algorithms that substantially reduce exponential complexity of this task. However, no asymptotic complexity bounds are known for distance verification in other ensembles of linear codes. Our goal is to re-design the existing generic algorithms of distance verification and derive their complexity for LDPC codes. We obtain new complexity bounds with provable performance expressed in terms of the erasure-correcting thresholds of long LDPC codes. These bounds exponentially reduce complexity estimates known for linear codes
Abstract—Recent work by Divsalar et al. has shown that properly designed protograph-based low-densit...
The techniques of distance verification known for general linear codes are first applied to the quan...
Our main technical result is that metric balls in the coset leader graph of a linear binary code of ...
The techniques of distance verification known for general linear codes are re-applied to quantum sta...
The techniques of distance verification known for general linear codes are re-applied to quantum sta...
An ensemble of (J, K) -regular low-density parity-check (LDPC) convolutional codes is introduced and...
An ensemble of $(J,K)$ -regular low-density parity- check (LDPC) convolutional codes is introduced a...
Abstract—An ensemble of-regular LDPC convolutional codes is introduced and existence-type lower boun...
The Alon-Edmonds-Luby distance amplification procedure (FOCS 1995) is an algorithm that transforms a...
The techniques of distance verification known for general linear codes are first applied to the quan...
In this paper, we obtain lower and upper bounds on the minimum distance dmin of low-density parity-c...
A lower bound on the free distance of LDPC convolutional codes defined by syndrome former matrices c...
International audienceWe study necessary conditions which have to be satisfied in order to have LDPC...
International audienceWe study necessary conditions which have to be satisfied in order to have LDPC...
ABSTRACT. Minimum distance is an important parameter of a linear error correcting code. For improved...
Abstract—Recent work by Divsalar et al. has shown that properly designed protograph-based low-densit...
The techniques of distance verification known for general linear codes are first applied to the quan...
Our main technical result is that metric balls in the coset leader graph of a linear binary code of ...
The techniques of distance verification known for general linear codes are re-applied to quantum sta...
The techniques of distance verification known for general linear codes are re-applied to quantum sta...
An ensemble of (J, K) -regular low-density parity-check (LDPC) convolutional codes is introduced and...
An ensemble of $(J,K)$ -regular low-density parity- check (LDPC) convolutional codes is introduced a...
Abstract—An ensemble of-regular LDPC convolutional codes is introduced and existence-type lower boun...
The Alon-Edmonds-Luby distance amplification procedure (FOCS 1995) is an algorithm that transforms a...
The techniques of distance verification known for general linear codes are first applied to the quan...
In this paper, we obtain lower and upper bounds on the minimum distance dmin of low-density parity-c...
A lower bound on the free distance of LDPC convolutional codes defined by syndrome former matrices c...
International audienceWe study necessary conditions which have to be satisfied in order to have LDPC...
International audienceWe study necessary conditions which have to be satisfied in order to have LDPC...
ABSTRACT. Minimum distance is an important parameter of a linear error correcting code. For improved...
Abstract—Recent work by Divsalar et al. has shown that properly designed protograph-based low-densit...
The techniques of distance verification known for general linear codes are first applied to the quan...
Our main technical result is that metric balls in the coset leader graph of a linear binary code of ...