Publikationer
Chained Gallager codes
Avdelning/ar:
Publiceringsår: 2009
Språk: Engelska
Fulltext:
Dokumenttyp: Konferensbidrag
Sammanfattning
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.
Disputation
Nyckelord
- Technology and Engineering
Övrigt
International Symposium on Problems of Redundancy in Information and Control Systems
2009-05-26/2009-05-30
St. Petersburg
Published
Yes
- Information Theory
