Short column-weight-three LDPC codes without small trapping sets

Dung Viet Nguyen, Martin Leslie, Bane Vasić

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

We introduce a method to construct regular column-weight-three low-density parity-check (LDPC) codes with low error floors for the sum product algorithm (SPA) on the binary symmetric channel (BSC). The Tanner graphs of these codes are free of certain small trapping sets. These trapping sets are selected from the Trapping Set Ontology for the Gallager A/B decoder and are selected based on their relative harmfulness for the SPA. We evaluate the relative harmfulness of different trapping sets for the SPA by using the topological relations among them and by analyzing decoding failures on one trapping set in the presence or absence of other trapping sets. To the best of our knowledge, these codes outperform the best known short length, regular column-weight-three LDPC codes.

Original languageEnglish (US)
Title of host publication2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
Pages172-179
Number of pages8
DOIs
StatePublished - Dec 1 2010
Event48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 - Monticello, IL, United States
Duration: Sep 29 2010Oct 1 2010

Publication series

Name2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Other

Other48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
CountryUnited States
CityMonticello, IL
Period9/29/1010/1/10

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Short column-weight-three LDPC codes without small trapping sets'. Together they form a unique fingerprint.

Cite this