2009 International Conference on Advanced Information Networking and Applications Design of Quasi-Cyclic LDPC Codes Based on Euclidean Geometries Bradford, United Kingdom May 26-May 29 ISBN: 978-0-7695-3638-5
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2009.35
This paper presents an algebraic method for constructing quasi-cyclic (QC) low-density parity-check (LDPC) codes based on the structural properties of Euclidean geometries. The construction method results in a class of QC-LDPC codes with girth of at least 6. Codes in this class perform very close to the Shannon limit with iterative decoding. Simulations show that the designed QC-LDPC codes have almost the same performance with the
Index Terms:
low-density parity-check codes, quasi-cyclic, Euclidean geometry, iterative method
Citation:
Yuan-Hua Liu, Xin-Mei Wang, Jian-Hua Ma, "Design of Quasi-Cyclic LDPC Codes Based on Euclidean Geometries," aina, pp.207-211, 2009 International Conference on Advanced Information Networking and Applications, 2009 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||