On the minimum trapping distance of repeat accumulate accumulate codes

Joerg Kliewer, Kamil S. Zigangirov, Daniel J. Costello

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

3 Scopus citations

Abstract

We consider the ensemble of codes formed by a serial concatenation of a repetition code with two accumulators through uniform random interleavers. For this ensemble, asymptotic expressions for the normalized minimum trapping distance are derived. We employ a variant of the Gallager-Zyablov-Pinsker bit flipping decoding algorithm on a binary symmetric channel, where the analysis is based on the factor graph of the code. In particular, we show that the minimum trapping distance can be determined by solving a non-linear optimization problem. As a result we find that the minimum trapping distance grows linearly with block length for code rates of 1/3 and smaller, albeit with very small growth rate coefficients.

Original languageEnglish (US)
Title of host publication46th Annual Allerton Conference on Communication, Control, and Computing
Pages1410-1415
Number of pages6
DOIs
StatePublished - Dec 1 2008
Externally publishedYes
Event46th Annual Allerton Conference on Communication, Control, and Computing - Monticello, IL, United States
Duration: Sep 24 2008Sep 26 2008

Publication series

Name46th Annual Allerton Conference on Communication, Control, and Computing

Other

Other46th Annual Allerton Conference on Communication, Control, and Computing
CountryUnited States
CityMonticello, IL
Period9/24/089/26/08

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Software
  • Control and Systems Engineering
  • Communication

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

Cite this