On graphical representations of algebraic codes suitable for iterative decoding

Vidya Kumar, Olgica Milenkovic

Research output: Contribution to journalArticlepeer-review


In this paper, we describe two novel modifications of an algorithm for deriving sparse parity-check matrix representations of classical binary and non-binary algebraic codes. The proposed sparse representations are obtained by introducing a small number of auxiliary variables and check-equations that lead to Tanner graphs without four-cycles. When used with iterative decoding, the developed code representations show significant gain in performance when compared to other known description techniques.

Original languageEnglish (US)
Pages (from-to)729-731
Number of pages3
JournalIEEE Communications Letters
Issue number8
StatePublished - Aug 1 2005
Externally publishedYes


  • Algebraic codes
  • Four-cycles
  • Iterative decoding

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'On graphical representations of algebraic codes suitable for iterative decoding'. Together they form a unique fingerprint.

Cite this