On trapping sets for repeat accumulate accumulate codes

Jörg Kliewer, Christian Koller, Alexandre Graell I. Amat, Daniel J. Costello

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

1 Scopus citations

Abstract

The serial concatenation of a repetition code with two or more accumulators has the advantage of a simple encoder structure. Furthermore, the resulting ensemble is asymptotically good and exhibits minimum distance growing linearly with block length. For low-density parity-check codes, the notion of trapping sets has been introduced to estimate the performance of these codes under non-maximum likelihood decoding. We briefly address asymptotic expressions for the normalized minimum trapping distance for the Gallager-Zyablov-Pinsker bit flipping decoding algorithm. Then we consider belief propagation decoding and present a closed form finite length ensemble average trapping set enumerator for repeat accumulate accumulate codes by creating a trellis representation of trapping sets. For this case, we also obtain asymptotic expressions and evaluate them numerically.

Original languageEnglish (US)
Title of host publicationInformation Theory and Applications Workshop, ITA 2009
Pages164-168
Number of pages5
DOIs
StatePublished - Sep 25 2009
Externally publishedYes
EventInformation Theory and Applications Workshop, ITA 2009 - San Diego, CA, United States
Duration: Feb 8 2009Feb 13 2009

Publication series

NameInformation Theory and Applications Workshop, ITA 2009

Other

OtherInformation Theory and Applications Workshop, ITA 2009
CountryUnited States
CitySan Diego, CA
Period2/8/092/13/09

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Information Systems

Fingerprint Dive into the research topics of 'On trapping sets for repeat accumulate accumulate codes'. Together they form a unique fingerprint.

Cite this