Characterization of small trapping sets in LDPC codes from Steiner triple systems

Stefan Laendner, Olgica Milenkovic, Johannes B. Huber

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

Abstract

The error-floor performance of low-density parity-check (LDPC) codes under iterative decoding is governed by combinatorial configurations in the Tanner graph of the code termed trapping sets. Finding the smallest trapping set in a Tanner graph is an NP-hard problem. However, for codes constructed from designs one can partially characterize trapping sets and enumerate them efficiently. We focus on LDPC codes based on Steiner triple systems (STS), and quantify small trapping sets for bit-flipping decoding over the BSC and small trapping sets for the AWGN channel. Furthermore , we provide simulation results that show that the enumeration scheme at hand provides good estimates for the error-floor behavior of STS LDPC codes.

Original languageEnglish (US)
Title of host publication6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010
Pages93-97
Number of pages5
DOIs
StatePublished - 2010
Event6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010 - Brest, France
Duration: Sep 6 2010Sep 10 2010

Publication series

Name6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010

Other

Other6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010
Country/TerritoryFrance
CityBrest
Period9/6/109/10/10

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'Characterization of small trapping sets in LDPC codes from Steiner triple systems'. Together they form a unique fingerprint.

Cite this