Abstract
A generalization of Gallager's low-density parity-check codes is introduced, where as component codes single-error correcting Hamming codes are used instead of single-error detecting parity-check codes. Low-density (LD) parity-check codes were first introduced by Gallager in 1963. These codes are, in combination with iterative decoding, very promising for achieving low error probabilities at a reasonable cost. Results of computer simulations for long LD codes show, that a performance close to the Shannon capacity limit can be achieved. In this work, we consider a generalized version of low-density parity-check codes, where the decoding procedure can be based on the decoding of Hamming component codes
| Original language | English |
|---|---|
| Title of host publication | [Host publication title missing] |
| Publisher | IEEE - Institute of Electrical and Electronics Engineers Inc. |
| ISBN (Print) | 0-7803-5000-6 |
| DOIs | |
| Publication status | Published - 1998 |
| Event | IEEE International Symposium on Information Theory (ISIT), 1998 - Cambridge, MA, Cambridge, MA, United States Duration: 1998 Aug 16 → 1998 Aug 21 |
Conference
| Conference | IEEE International Symposium on Information Theory (ISIT), 1998 |
|---|---|
| Country/Territory | United States |
| City | Cambridge, MA |
| Period | 1998/08/16 → 1998/08/21 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering
Free keywords
- LDPC codes
- generalized LDPC codes
- GLDPC codes