In this correspondence the error exponent and the decoding complexity of bi
nary woven convolutional codes with outer warp and with binary convolutiona
l codes as outer and inner codes are studied. It is shown that an error pro
bability that is exponentially decreasing with the product of the outer and
inner code memories can be achieved with a nonexponentially increasing dec
oding complexity.