Structured LDPC codes over integer residue rings

Authors:
Elisa Mo;Marc A. Armand
Affiliations:
Department of Electrical and Computer Engineering, National University of Singapore, Singapore;Department of Electrical and Computer Engineering, National University of Singapore, Singapore
Venue:
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
Year:
2008

Citing 7
Cited 0

Low-density parity-check codes based on finite geometries: a rediscovery and new results

IEEE Transactions on Information Theory
Combinatorial constructions of low-density parity-check codes for iterative decoding

IEEE Transactions on Information Theory
LDPC Codes Over Rings for PSK Modulation

IEEE Transactions on Information Theory
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels

IEEE Transactions on Information Theory
Shortened Array Codes of Large Girth

IEEE Transactions on Information Theory
Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights

IEEE Transactions on Information Theory
Linear block codes over cyclic groups

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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