Advanced

A lower bound on the minimum distance of chained Gallager codes

Zyablov, Victor; Hug, Florian LU and Johannesson, Rolf LU (2009) IEEE Information Theory Winter School, 2009
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to conference
publication status
published
subject
conference name
IEEE Information Theory Winter School, 2009
language
English
LU publication?
yes
id
804c3b77-8d06-4ca5-8329-028a8a6b1a66 (old id 1540320)
date added to LUP
2010-02-01 14:15:16
date last changed
2016-04-16 11:10:09
@misc{804c3b77-8d06-4ca5-8329-028a8a6b1a66,
  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.},
  author       = {Zyablov, Victor and Hug, Florian and Johannesson, Rolf},
  language     = {eng},
  title        = {A lower bound on the minimum distance of chained Gallager codes},
  year         = {2009},
}