Open Access

Structured LDPC Codes over Integer Residue Rings

EURASIP Journal on Wireless Communications and Networking20082008:598401

https://doi.org/10.1155/2008/598401

Received: 31 October 2007

Accepted: 3 June 2008

Published: 12 June 2008

Abstract

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

Authors’ Affiliations

(1)
Department of Electrical and Computer Engineering, National University of Singapore

Copyright

© E. Mo and MarcA. Armand. 2008

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.