DescriptionSizeFormat
Publisher version (open access)279 KBAdobe Acrobat PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/27612

Title
A family of irregular LDPC codes with low encoding complexity
Author/Creator
Johnson, Sarah J.;  Weller, Steven R.
Description
We consider irregular quasi-cyclic low-density parity-check (LDPC) codes derived from difference families. The resulting codes can be encoded with low complexity and perform well when iteratively decoded with the sum-product algorithm.
Relation
IEEE Communications Letters Vol. 7, Issue 2, p. 79-81
Publisher Link
http://dx.doi.org/10.1109/LCOMM.2002.808375
Date
2003
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Keyword(s)
difference families;  iterative decoding;  low encoding complexity;  quasi-cyclic low-density parity-check codes;  sum-product algorithm;  sum-product decoding;  computational complexity;  cyclic codes;  parity check codes
Resource Type
journal article
Rights
Copyright © 2003 IEEE. Reprinted from IEEE Communications Letters, Vol. 7, Issue 2, p. 79-81. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Newcastle's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Identifier
http://hdl.handle.net/1959.13/27612
Identifier
ISSN:1089-7798
Reviewed
Reviewed
Full Text
Full Text
 
Image Thumbnail
58 Visitors 63 Hits 4 Downloads
Save/E-mail Citation
Citation Format
E-mail Address
Subject
"IEEE Communications Letters"
 
OR