Abstract
The design of a class of well-structured low-density parity-check (LDPC) codes, namely linear interleaver based concatenated zigzag (LICZ) codes, is investigated. With summary distances as the design metric, short LICZ codes with large minimum distances can be constructed. Moreover, an efficient cycle-based method is proposed to compute the minimum distances of LICZ codes. Simulation results show that LICZ codes outperform both CZ codes with random interleavers and LDPC codes by the progressive edge growth algorithm. © The Institution of Engineering and Technology 2008.
| Original language | English |
|---|---|
| Pages (from-to) | 1149-1150 |
| Journal | Electronics Letters |
| Volume | 44 |
| Issue number | 19 |
| DOIs | |
| Publication status | Published - 2008 |
Fingerprint
Dive into the research topics of 'Joint linear interleaver design for concatenated zigzag codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver