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)


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
Publication statusPublished - 2005
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: 2005 Sept 42005 Sept 9

Bibliographical note

Publisher Copyright:
© 2005 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.

All Science Journal Classification (ASJC) codes

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


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

Cite this