Chained Gallager codes
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.
- Electrical Engineering, Electronic Engineering, Information Engineering
International Symposium on Problems of Redundancy in Information and Control Systems
- Information Theory-lup-obsolete