DocumentCode
745635
Title
A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols
Author
Djurdjevic, Ivana ; Xu, Jun ; Abdel-Ghaffar, Khaled ; Lin, Shu
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of California, Davis, CA, USA
Volume
7
Issue
7
fYear
2003
fDate
7/1/2003 12:00:00 AM
Firstpage
317
Lastpage
319
Abstract
This letter 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.
Keywords
Reed-Solomon codes; graph theory; iterative decoding; parity check codes; LDPC codes; Reed-Solomon codes; Tanner graphs; information symbols; iterative decoding; low-density parity-check codes; minimum distances; Algebra; Error correction codes; Galois fields; Iterative decoding; Parity check codes; Reed-Solomon codes; Sum product algorithm;
fLanguage
English
Journal_Title
Communications Letters, IEEE
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2003.814716
Filename
1214058
Link To Document