On the error exponent for woven convolutional codes with outer warp

作     者：Zyablov, V Shavgulidze, S Skopintsev, O Höst, S Johannesson, R 

作者机构：Univ Lund Dept Informat Technol Informat Theory Grp S-22100 Lund Sweden 

出 版 物：《IEEE TRANSACTIONS ON INFORMATION THEORY》 (IEEE Trans. Inf. Theory)

年 卷 期：1999年第45卷第5期

页      面：1649-1653页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Royal Swedish Academy of Sciences, KVA Russian Academy of Sciences, РАН Vetenskapsrådet, VR, (97-723) 

主　　题：concatenated convolutional codes decoding complexity woven convolutional codes woven error exponents 

摘      要：In this correspondence the error exponent and the decoding complexity of binary woven convolutional codes with outer warp and with binary convolutional codes as outer and inner codes are studied. It is shown that an error probability that is exponentially decreasing with the product of the outer and inner code memories can be achieved with a nonexponentially increasing decoding complexity.