A Class of Group-Structured LDPC Codes

299 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

LDPC block and convolutional codes based on circulant matrices (2004, methodology): “Examples of codes constructed in this manner from a prime are shown in Table I [13], and examples constructed from a nonprime are shown in Table II.”
Quasicyclic low-density parity-check codes from circulant permutation matrices (2004, background): “…we consider now the (3; 5)-regular code of the same length and dimension constructed in [16] as described in Section III-B3 for q 1 = 5, q 2 = 2, and p = 31, its matrix H is given by Although dH = 20 for this code [16], no two elements are the same in the table obtained by the proposed procedure.”
Regular and irregular progressive edge-growth tanner graphs (2005, background): “For more results obtained by various authors, the reader is referred to [23]–[26].”