Abstract
A new method is given to construct low-density parity check codes the graphs of which are of designed girth. We give examples to illustrate the new method, and also present performance diagrams that suggest that these codes are as good as random codes in low SNR, and preferable to random codes at higher SNR.
| Original language | English |
|---|---|
| Title of host publication | 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS |
| Publisher | IEEE |
| Pages | 235 |
| Number of pages | 1 |
| ISBN (Print) | 0-7803-8280-3 |
| Publication status | Published - 2004 |
| MoE publication type | A4 Article in a conference publication |
| Event | IEEE International Symposium on Information Theory - Chicago, Israel Duration: 27 Jun 2004 → 2 Jul 2004 |
Conference
| Conference | IEEE International Symposium on Information Theory |
|---|---|
| Country | Israel |
| City | Chicago |
| Period | 27/06/2004 → 02/07/2004 |