The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

På svenska

Author

Summary, in English

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.

Publishing year

2010

Language

English

Pages

316-331

Publication/Series

IEEE Transactions on Information Theory

Volume

56

Issue

1

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

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

Status

Published

Research group

  • Information Theory

ISBN/ISSN/Other

  • ISSN: 0018-9448