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

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

Title
Quasi-cyclic LDPC codes from difference families
Author/Creator
Johnson, Sarah J.;  Weller, Steven R.
Description
We consider in this paper regular and nearly regular quasi-cyclic low-density parity-check (LDPC) codes, derived from families of difference sets. The codes have girth at least 6, and sparse parity-check matrices. They are designed to perform well when iteratively decoded with the sum-product decoding algorithm and to allow low complexity encoding.
Relation
3rd Australian Communications Theory Workshop, 2002 (AusCTW 2002). Proceedings: 3rd Australian Communications Theory Workshop, 2002 (Canberra 4-5 February, 2002) p. 18-22
Date
2002
Publisher
Australian National University
Keyword(s)
low-density parity-check (LDPC) codes;  sum-product decoding algorithm;  low complexity encoding;  difference families
Resource Type
conference paper
Identifier
http://hdl.handle.net/1959.13/31517
Identifier
ISBN:0958034508
Language
eng
Reviewed
Reviewed
Full Text
Full Text
 
Image Thumbnail
35 Visitors 46 Hits 4 Downloads
Save/E-mail Citation
Citation Format
E-mail Address
Subject
"Quasi-cyclic LDPC codes from difference families"
 
OR