Abstract
A combinatorial construction of regular low-density parity check (LDPC) codes was introduced based on balanced incomplete block designs (BIBD). Several constructions were presented and the bounds on minimal distance were derived by using the concept of Pasch configuration. The bounds on the minimum distance of the BIBD codes were solely functional on the parity check matrix column weight.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 312 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2002 |
| 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