Design of an LDPC code with low error floor

Sang Hyun Lee, Kwang Soon Kim, Jae Kyun Kwon, Yun Hee Kim, Jae Young Ahn

Research output: Contribution to journalConference articlepeer-review

2 Citations (Scopus)

Abstract

A search algorithm for stopping sets in a Tanner graph is proposed for designing good low-density parity-check (LDPC) codes. By applying the belief-propagation algorithm with messages containing the information of originated variable nodes and their connected edges, the stopping sets can be detected. Furthermore, a code design method using the algorithm is presented and the performances of the designed code over several channels are shown.

Original languageEnglish
Article number1523486
JournalIEEE International Symposium on Information Theory - Proceedings
Volume2005-January
DOIs
Publication statusPublished - 2005
Externally publishedYes
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: 2005 Sep 42005 Sep 9

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Design of an LDPC code with low error floor'. Together they form a unique fingerprint.

Cite this