Name
Abstract | ||
|---|---|---|
Two algebraic methods for systematic construction of structured regular and irregular low-density parity-check (LDPC) codes with girth of at least six and good minimum distances are presented. These two methods are based on geometry decomposition and a masking technique. Numerical results show that the codes constructed by these methods perform close to the Shannon limit and as well as random-like LDPC codes. Furthermore, they have low error floors and their iterative decoding converges very fast. The masking technique greatly simplifies the random-like construction of irregular LDPC codes designed on the basis of the degree distributions of their code graphs |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/TIT.2006.887082 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
random-like ldpc code,random codes,shannon limit,geometry decomposition,irregular ldpc codes,structured regular ldpc code,irregular low-density parity-check,irregular low-density parity-check code,degree distribution,irregular ldpc code,permutation matrix,systematic construction,masking,euclidean geometry,random-like construction,code graph,masking technique,graph theory,iterative decoding,algebraic codes,algebraic method,parity check codes,ldpc code,low density parity check | Discrete mathematics,Combinatorics,Concatenated error correction code,Computer science,Low-density parity-check code,Block code,Turbo code,Serial concatenated convolutional codes,Error detection and correction,Decoding methods,Geometry,Noisy-channel coding theorem | Journal |
Volume | Issue | ISSN |
53 | 1 | 0018-9448 |
Citations | PageRank | References |
60 | 2.60 | 34 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Xu | 1 | 115 | 6.79 |
| L. Chen | 2 | 69 | 6.14 |
| ivana djurdjevic | 3 | 63 | 3.16 |
| S. Lin | 4 | 1280 | 124.59 |
| K. Abdel-Ghaffar | 5 | 238 | 13.36 |