Chained Gallager codes

Victor Zyablov, Florian Hug, Rolf Johannesson

Forskningsoutput: KonferensbidragKonferenspaper, ej i proceeding/ej förlagsutgivetPeer review

52 Nedladdningar (Pure)

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.
Originalspråkengelska
StatusPublished - 2009
EvenemangInternational Symposium on Problems of Redundancy in Information and Control Systems - St. Petersburg
Varaktighet: 2009 maj 262009 maj 30

Konferens

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

Ämnesklassifikation (UKÄ)

  • Elektroteknik och elektronik

Citera det här