Braided convolutional codes

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

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingResearchpeer-review

1 Citation (SciVal)

Abstract

We present a new class of iteratively decodable turbo-like codes, called braided convolutional codes. Constructions and encoding procedures for tightly and sparsely braided 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
Original languageEnglish
Title of host publication[Host publication title missing]
PublisherIEEE - Institute of Electrical and Electronics Engineers Inc.
Pages592-596
ISBN (Print)0-7803-9151-9
DOIs
Publication statusPublished - 2005
EventIEEE International Symposium on Information Theory (ISIT), 2005 - Adelaide, Australia
Duration: 2005 Sep 42005 Sep 9

Conference

ConferenceIEEE International Symposium on Information Theory (ISIT), 2005
Abbreviated titleISIT05
Country/TerritoryAustralia
CityAdelaide
Period2005/09/042005/09/09

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • spatial coupling
  • braided convolutional codes

Fingerprint

Dive into the research topics of 'Braided convolutional codes'. Together they form a unique fingerprint.

Cite this