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

Keywords:
Turbo code Serial concatenated convolutional codes Convolutional code Computer science Concatenated error correction code Linear code Theoretical computer science Algorithm Decoding methods Encoding (memory) Sequential decoding Block code BCJR algorithm Constraint (computer-aided design) Convergence (economics) Mathematics Artificial intelligence

Metrics

10
Cited By
0.53
FWCI (Field Weighted Citation Impact)
18
Refs
0.70
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Error Correcting Code Techniques
Physical Sciences →  Computer Science →  Computer Networks and Communications
Advanced Wireless Communication Techniques
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Coding theory and cryptography
Physical Sciences →  Computer Science →  Artificial Intelligence
© 2026 ScienceGate Book Chapters — All rights reserved.