Asymptotically Good Woven Codes with Fixed Constituent Convolutional Codes
Irina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson, Victor Zyablov · 2007
A construction of woven graph codes based on constituent convolutional codes is studied. It is shown that within the random ensemble of such codes there exist asymptotically good codes with short fixed constituent codes. An example of a rate R = 1/3 woven graph code with free distance equal to 32 based on rate Rc= 2/3 constituent convolutional codes with overall constraint length 5 is given.