The ensemble of regular Low-Density Parity-Check (LDPC) codes introduced by Gallager is considered. Using probabilistic arguments a lower bound on the normalized minimum distance is derived. A new code construction, called Chained Gallager codes, is introduced as the combination of two Gallager codes and its error correcting capabilities are studied.
|Status||Published - 2009|
|Evenemang||International Symposium on Problems of Redundancy in Information and Control Systems - St. Petersburg|
Varaktighet: 2009 maj 26 → 2009 maj 30
|Konferens||International Symposium on Problems of Redundancy in Information and Control Systems|
|Period||2009/05/26 → 2009/05/30|
- Elektroteknik och elektronik