Sciweavers

Share
DCC
2004
IEEE

LDPC Codes from Triangle-Free Line Sets

11 years 24 days ago
LDPC Codes from Triangle-Free Line Sets
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles and necessarily has girth at least 8. One can then use the associated incidence matrices to form binary linear codes which can be considered as LDPC codes. The relatively high girth allows for efficient implementation of these codes. We give two general constructions for such triangle-free line sets and give the parameters for the associated codes when q is small.
Keith E. Mellinger
Added 25 Dec 2009
Updated 25 Dec 2009
Type Conference
Year 2004
Where DCC
Authors Keith E. Mellinger
Comments (0)
books