Chained Gallager codes

Victor Zyablov, Florian Hug, Rolf Johannesson

Research output: Contribution to conferencePaper, not in proceedingpeer-review

49 Downloads (Pure)

Abstract

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.
Original languageEnglish
Publication statusPublished - 2009
EventInternational Symposium on Problems of Redundancy in Information and Control Systems - St. Petersburg
Duration: 2009 May 262009 May 30

Conference

ConferenceInternational Symposium on Problems of Redundancy in Information and Control Systems
Period2009/05/262009/05/30

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Cite this