Braided Convolutional Codes: A New Class of Turbo-Like Codes

Wei Zhang, Michael Lentmaier, Kamil Zigangirov, Daniel J., Jr. Costello

Research output: Contribution to journalArticlepeer-review

37 Citations (SciVal)
291 Downloads (Pure)


We present a new class of iteratively decodable turbo-like codes, called braided convolutional codes. Constructions and encoding procedures for tightly and sparsely braided convolutional codes are introduced. Sparsely braided codes exhibit good convergence behavior with iterative decoding, and a statistical analysis using Markov permutors shows that the free distance of these codes grows linearly with constraint length, i.e., they are asymptotically good.
Original languageEnglish
Pages (from-to)316-331
JournalIEEE Transactions on Information Theory
Issue number1
Publication statusPublished - 2010

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering


  • turbo-like codes
  • iterative decoding
  • free distance
  • convolutional permutor
  • Braided convolutional codes
  • codes on graphs


Dive into the research topics of 'Braided Convolutional Codes: A New Class of Turbo-Like Codes'. Together they form a unique fingerprint.

Cite this