Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Journal article
Title: High girth column-weight-two LDPC codes based on distance graphs
Author: Malema, G.
Liebelt, M.
Citation: EURASIP Journal on Wireless Communications and Networking, 2007; 2007(1):1-5
Publisher: EURASIP Journal on Wireless Communications and Networking
Issue Date: 2007
ISSN: 1687-1472
Statement of
Gabofetswe Malema and Michael Liebelt
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.
Description: Copyright © 2007 G. Malema and M. Liebelt. 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.
RMID: 0020070256
DOI: 10.1155/2007/48158
Appears in Collections:Electrical and Electronic Engineering publications
Environment Institute publications

Files in This Item:
File Description SizeFormat 
hdl_43093.pdf284.4 kBPublisher's PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.