Multiple-bases belief-propagation decoding of high-density cyclic codes

Thorsten Hehn, Johannes Huber, Olgica Milenkovic, Stefan Laendner

Research output: Contribution to journalArticle


We introduce a new method for decoding short and moderate-length linear block codes with dense paritycheck matrix representations of cyclic form. This approach is termed multiple-bases belief-propagation. The proposed iterative scheme makes use of the fact that a code has many structurally diverse parity-check matrices, capable of detecting different error patterns. We show that this inherent code property leads to decoding algorithms with significantly better performance when compared to standard belief-propagation decoding. Furthermore, we describe how to choose sets of parity-check matrices of cyclic form amenable for multiple-bases decoding, based on analytical studies performed for the binary erasure channel. For several cyclic and extended cyclic codes, the multiple-bases belief propagation decoding performance can be shown to closely follow that of the maximum-likelihood decoder.

Original languageEnglish (US)
Article number5397887
Pages (from-to)1-8
Number of pages8
JournalIEEE Transactions on Communications
Issue number1
StatePublished - Jan 1 2010


  • Algebraic codes
  • Belief propagation
  • Multiplebases belief-propagation decoding
  • Stopping sets

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Multiple-bases belief-propagation decoding of high-density cyclic codes'. Together they form a unique fingerprint.

  • Cite this