Du är här

A lower bound on the minimum distance of chained Gallager codes

Författare:
Publiceringsår: 2009
Språk: Engelska
Dokumenttyp: Konferensbidrag

Sammanfattning

Based on the combination of two regular Gallager (Low-Density Parity-Check (LDPC)) codes, we will introduce a new code construction, called Chained Gallager codes. Following Gallager’s method we will derive a lower bound on the normalized minimum distance for the ensemble of Chained Gallager codes. Applying this lower bound on the normalized minimum distance to different transmissions schemes with two parallel and independent channels, the error correcting capabilities will be studied, stressing the advantages of Chained Gallager codes.

Disputation

Nyckelord

  • Technology and Engineering

Övrigt

IEEE Information Theory Winter School
2009-03-29/2009-04-03
Loen, Norway
Published
  • 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

LERU logo U21 logo