|Publisher version (open access)||544 KB||Adobe Acrobat PDF||View/Open
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/31515
- Can cyclic codes be useful low-density parity-check codes?
Johnson, Sarah J.;
Weller, Steven R.
- Traditionally, low-density parity-check (LDPC) codes are constructed randomly and it is not clear whether algebraically constructed codes, such as cyclic codes, can compete with the error correction performances of the random codes. We consider in this paper new cyclic low-density parity-check codes decoded with the sum-product algorithm. The cyclic codes we present have sparse parity-check matrices, good minimum distance and girth 6. Using frnite-length analysis and simulation results we show that the most significant benefit of the new codes, in terms of error correction performance, is the linearly dependent rows in their parity-check matrices. Our results suggest that increasing column weight to improve the minimum distance and the minimum stopping set size of the code proves beneficial at low erasure probabilities but adversely affects performance in channels with high erasure probabilities.
- 4th Australian Communications Theory Workshop, 2003 (AusCTW 2003). Proceedings: 4th Australian Communications Theory Workshop, 2003 (Melbourne 5-7 February, 2003) p. 81-86
- Australian National University
low-density parity-check (LDPC) codes;
finite length analysis;
- Resource Type
- conference paper
- Full Text