Chained Gallager codes
Författare
Summary, in English
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.
Publiceringsår
2009
Språk
Engelska
Fulltext
- Available as PDF - 531 kB
- Download statistics
Dokumenttyp
Konferensbidrag
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Conference name
International Symposium on Problems of Redundancy in Information and Control Systems
Conference date
2009-05-26 - 2009-05-30
Status
Published
Forskningsgrupp
- Information Theory