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
Marcos B.S. TavaresMichael LentmaierKamil Sh. ZigangirovGerhard P. Fettweis
Min ZhuDavid G. M. MitchellMichael LentmaierDaniel J. CostelloBaoming Bai
Daniel J. CostelloMichael LentmaierDavid G. M. Mitchell
Min ZhuDavid G. M. MitchellMichael LentmaierDaniel J. CostelloBaoming Bai
Wei ZhangMichael LentmaierKamil Sh. ZigangirovDaniel J. Costello