Abstract
This paper presents an algebraic method for constructing regular low-density parity-check (LDPC) codes based on Reed-Solomon codes with two information symbols. The construction method results in a class of LDPC codes in Gallager's original form. Codes in this class are free of cycles of length 4 in their Tanner graphs and have good minimum distances. They perform well with iterative decoding. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Djurdjevic, I., Xu, J., Abdel-Ghaffar, K., & Lin, S. (2003). A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2643, 98–107. https://doi.org/10.1007/3-540-44828-4_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
