Javascript is not activated in your browser. This website needs javascript activated to work properly.
Du är här

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

Publiceringsår: 2010
Språk: Engelska
Sidor: 316-331
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 56
Nummer: 1
Dokumenttyp: Artikel
Förlag: IEEE-Inst Electrical Electronics Engineers Inc


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.



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


  • Information Theory
  • ISSN: 0018-9448

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen