High girth column-weight-two LDPC codes based on distance graphs

Authors:
Gabofetswe Malema;Michael Liebelt
Affiliations:
School of Electrical and Electronic Engineering, The University of Adelaide, Adelaide, SA, Australia;School of Electrical and Electronic Engineering, The University of Adelaide, Adelaide, SA, Australia
Venue:
EURASIP Journal on Wireless Communications and Networking
Year:
2007

Citing 2
Cited 2

Cubic graphs with large girth

Proceedings of the third international conference on Combinatorial mathematics
Fast generation of regular graphs and construction of cages

Journal of Graph Theory

Graph-based convolutional and block LDPC codes

Problems of Information Transmission
On the girth of voltage graph lifts

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

LDPC codes of column weight of two are constructed from minimal distance graphs or cages. Distance graphs are used to represent LDPC code matrices such that graph vertices that represent rows and edges are columns. The conversion of a distance graph into matrix form produces an adjacency matrix with column weight of two and girth double that of the graph. The number of 1's in each row (row weight) is equal to the degree of the corresponding vertex. By constructing graphs with different vertex degrees, we can vary the rate of corresponding LDPC code matrices. Cage graphs are used as examples of distance graphs to design codes with different girths and rates. Performance of obtained codes depends on girth and structure of the corresponding distance graphs.