Name
Abstract | ||
|---|---|---|
This correspondence presents three algebraic methods for constructing low-density parity-check (LDPC) codes. These methods are based on the structural properties of finite geometries. The first method gives a class of Gallager codes and a class of complementary Gallager codes. The second method results in two classes of circulant-LDPC codes, one in cyclic form and the other in quasi-cyclic form. The third method is a two-step hybrid method. Codes in these classes have a wide range of rates and minimum distances, and they perform well with iterative decoding. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/TIT.2004.828088 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
cyclic codes,iterative decoding,parity check codes,Euclidean geometry,Gallager codes,LDPC codes,algebraic construction,circulant low-density parity-check codes,cyclic code,finite geometries,iterative decoding,projective geometry,quasicyclic code,sum-product algorithm,two-step hybrid method,Cyclic code,Euclidean geometry,SPA,projective geometry,quasi-cyclic code,sum–product algorithm | Discrete mathematics,Concatenated error correction code,Combinatorics,Low-density parity-check code,Serial concatenated convolutional codes,Block code,Turbo code,Expander code,Raptor code,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
50 | 6 | 0018-9448 |
Citations | PageRank | References |
27 | 2.86 | 18 |
Authors | ||
5 | ||