论文信息 - Near Shannon limit quasi-cyclic low-density parity-check codes - 字舞流文

Near Shannon limit quasi-cyclic low-density parity-check codes

The paper presents two classes of quasi-cyclic low-density parity-check (LDPC) codes which perform close to the Shannon limit. The construction of these codes is based on decomposition of circulant matrices constructed from finite geometries.

Shu Lin | I. Djurdjevic | Jun Xu | Lei Chen

[1] Shu Lin,et al. Error control coding : fundamentals and applications , 1983 .

[2] David J. C. MacKay,et al. Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[3] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[4] Khaled A. S. Abdel-Ghaffar,et al. On algebraic construction of Gallager and circulant low-density parity-check codes , 2004, IEEE Transactions on Information Theory.

[5] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[6] Ian F. Blake,et al. The mathematical theory of coding , 1975 .

[7] Shu Lin,et al. Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.