Asymptotic distance properties of binary woven convolutional codes (Q1569278)

The authors describe two construction algorithms for convolutional codes; they define and investigate active distance properties of so-called woven convolutional codes. Using polynomial generator matrices and assuming that memories of both outer and inner codes grow infinitely, they analyze the asymptotic lower bound on active distances. They also investigate the construction complexity of woven convolutional codes and show that this complexity grows exponentially with the growth of code memory.