Du är här

Chained Gallager codes

Författare:
Publiceringsår: 2009
Språk: Engelska
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

Övriga

International Symposium on Problems of Redundancy in Information and Control Systems
2009-05-26/2009-05-30
St. Petersburg
Published
Yes
  • Information Theory

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

 

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen