Braided Convolutional Codes: A New Class of Turbo-Like Codes
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.
Department/s
Publishing year
2010
Language
English
Pages
316-331
Publication/Series
IEEE Transactions on Information Theory
Volume
56
Issue
1
Full text
- Available as PDF - 378 kB
- Download statistics
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