Skip to main content

Structured LDPC Codes over Integer Residue Rings


This paper presents a new class of low-density parity-check (LDPC) codes over represented by regular, structured Tanner graphs. These graphs are constructed using Latin squares defined over a multiplicative group of a Galois ring, rather than a finite field. Our approach yields codes for a wide range of code rates and more importantly, codes whose minimum pseudocodeword weights equal their minimum Hamming distances. Simulation studies show that these structured codes, when transmitted using matched signal sets over an additive-white-Gaussian-noise channel, can outperform their random counterparts of similar length and rate.

Publisher note

To access the full article, please see PDF

Author information

Authors and Affiliations


Corresponding author

Correspondence to Marc A Armand.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Mo, E., Armand, M.A. Structured LDPC Codes over Integer Residue Rings. J Wireless Com Network 2008, 598401 (2008).

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI:


  • Information System
  • System Application
  • Full Article
  • LDPC Code
  • Publisher Note