Abstract
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.
| Original language | English |
|---|---|
| Publication status | Published - 2009 |
| Event | IEEE Information Theory Winter School, 2009 - Loen, Norway Duration: 2009 Mar 29 → 2009 Apr 3 |
Course
| Course | IEEE Information Theory Winter School, 2009 |
|---|---|
| Country/Territory | Norway |
| City | Loen |
| Period | 2009/03/29 → 2009/04/03 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering