Abstract
Finite length analysis of low-density parity-check (LDPC) codes with large left degrees was discussed. Recursions for maximum stopping sets were calculated and used for calculating the (average) block- and bit- error probability for regular-degree LDPC codes. The block error probability was related to the code's lowest left degree.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 3 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2002 |
| Externally published | Yes |
| Event | 2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland Duration: Jun 30 2002 → Jul 5 2002 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics