Structured LDPC Codes over Integer Residue Rings

Structured LDPC Codes over Integer Residue Rings

This paper presents a new class of low-density parity-check (LDPC) codes over ℤ2a 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...

Full description

Bibliographic Details
Main Authors: Marc A. Armand, Elisa Mo
Format: Article
Language:English
Published: SpringerOpen 2008-07-01
Series:EURASIP Journal on Wireless Communications and Networking
Online Access:http://dx.doi.org/10.1155/2008/598401
id doaj-4e018660dcc7433bafcbf2d910816aa9
record_format Article
spelling doaj-4e018660dcc7433bafcbf2d910816aa92020-11-25T00:34:59ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14721687-14992008-07-01200810.1155/2008/598401Structured LDPC Codes over Integer Residue RingsMarc A. ArmandElisa MoThis paper presents a new class of low-density parity-check (LDPC) codes over ℤ2a 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.http://dx.doi.org/10.1155/2008/598401
collection DOAJ
language English
format Article
sources DOAJ
author Marc A. Armand
Elisa Mo
spellingShingle Marc A. Armand
Elisa Mo
Structured LDPC Codes over Integer Residue Rings
EURASIP Journal on Wireless Communications and Networking
author_facet Marc A. Armand
Elisa Mo
author_sort Marc A. Armand
title Structured LDPC Codes over Integer Residue Rings
title_short Structured LDPC Codes over Integer Residue Rings
title_full Structured LDPC Codes over Integer Residue Rings
title_fullStr Structured LDPC Codes over Integer Residue Rings
title_full_unstemmed Structured LDPC Codes over Integer Residue Rings
title_sort structured ldpc codes over integer residue rings
publisher SpringerOpen
series EURASIP Journal on Wireless Communications and Networking
issn 1687-1472
1687-1499
publishDate 2008-07-01
description This paper presents a new class of low-density parity-check (LDPC) codes over ℤ2a 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.
url http://dx.doi.org/10.1155/2008/598401
work_keys_str_mv AT marcaarmand structuredldpccodesoverintegerresiduerings
AT elisamo structuredldpccodesoverintegerresiduerings
_version_ 1725311075935584256

Similar Items