- Title
- Quasi-cyclic LDPC codes from difference families
- Creator
- Johnson, Sarah J.; Weller, Steven R.
- Relation
- 3rd Australian Communications Theory Workshop, 2002 (AusCTW 2002). Proceedings: 3rd Australian Communications Theory Workshop, 2002 (Canberra 4-5 February, 2002) p. 18-22
- Publisher
- Australian National University
- Resource Type
- conference paper
- Date
- 2002
- 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.
- Subject
- low-density parity-check (LDPC) codes; sum-product decoding algorithm; low complexity encoding; difference families
- Identifier
- uon:2756
- Identifier
- http://hdl.handle.net/1959.13/31517
- Identifier
- ISBN:0958034508
- Language
- eng
- Full Text
- Reviewed
- Hits: 857
- Visitors: 911
- Downloads: 94
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT01 | Publisher version (open access) | 153 KB | Adobe Acrobat PDF | View Details Download |