Construction of good LDPC codes using dilation matrices

M Greferath*, ME O'Sullivan, R Smarandache

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

6 Citations (Scopus)

Abstract

A new method is given to construct low-density parity check codes the graphs of which are of designed girth. We give examples to illustrate the new method, and also present performance diagrams that suggest that these codes are as good as random codes in low SNR, and preferable to random codes at higher SNR.

Original languageEnglish
Title of host publication2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS
PublisherIEEE
Pages235
Number of pages1
ISBN (Print)0-7803-8280-3
Publication statusPublished - 2004
MoE publication typeA4 Article in a conference publication
EventIEEE International Symposium on Information Theory - Chicago, Israel
Duration: 27 Jun 20042 Jul 2004

Conference

ConferenceIEEE International Symposium on Information Theory
CountryIsrael
CityChicago
Period27/06/200402/07/2004

Cite this