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

This letter presents two classes of quasi-cyclic low-density parity-check codes that perform close to the Shannon limit.

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2004-07, Vol.52 (7), p.1038-1042
Main Authors: Lei Chen, Jun Xu, Djurdjevic, I., Lin, S.
Format: Article
Language:English
Subjects:
Communications Society
Computational modeling
Computer errors
Floors
Iterative decoding
Modulation coding
Null space
Parity check codes
Registers
Sum product algorithm
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This letter presents two classes of quasi-cyclic low-density parity-check codes that perform close to the Shannon limit.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2004.831353