DocumentCode :
1037992
Title :
Near-Shannon-limit quasi-cyclic low-density parity-check codes
Author :
Chen, Lei ; Xu, Jun ; Djurdjevic, Ivana ; Lin, Shu
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of California, Davis, CA, USA
Volume :
52
Issue :
7
fYear :
2004
fDate :
7/1/2004 12:00:00 AM
Firstpage :
1038
Lastpage :
1042
Abstract :
This letter presents two classes of quasi-cyclic low-density parity-check codes that perform close to the Shannon limit.
Keywords :
algebraic geometric codes; cyclic codes; iterative decoding; parity check codes; random codes; algebraic method; array decomposition; iterative decoding; low-density parity-check codes; near-Shannon-limit codes; quasi-cyclic codes; random codes; Communications Society; Computational modeling; Computer errors; Floors; Iterative decoding; Modulation coding; Null space; Parity check codes; Registers; Sum product algorithm; Circulants; decomposition; descendants; quasi-cyclic;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOMM.2004.831353
Filename :
1315899
Link To Document :
بازگشت