We find that with careful design, protograph-based DGLDPC codes can have a better asymptotic growth rate of minimum distance than that of the protograph-based ...
Abstract— Protograph-based doubly generalized. LDPC. (DGLDPC) codes are explored in this paper. We extend (and in the process simplify) the technique for ...
Abstract—Protograph-based LDPC codes have the advan- tages of a simple design (or search) procedure and highly structured encoders and decoders.
Missing: doubly | Show results with:doubly
We find that with careful design, protograph-based DGLDPC codes can have a better asymptotic growth rate of minimum distance than that of the protograph-based ...
Recently, LDPC codes with projected graph, or protograph structures have been proposed. In this paper, finite length ensemble weight enumerators for LDPC ...
Abstract— Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured en- coders and decoders.
Missing: doubly | Show results with:doubly
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check ...
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the “doping” of standard LDPC ...
Abstract—In this paper, we provide a proof for the conjec- ture made by Abu Surra et al. [1] to simplify the computation of ensemble input output weight ...
Missing: doubly | Show results with:doubly
People also ask
What is the difference between LDPC and convolutional codes?
What is the girth of the Ldpc code?
Ensemble weight enumerators for protograph-based doubly generalized LDPC codes · Computer Science, Mathematics. 2008 IEEE International Symposium on Information…