'Diffuse' threshold decodable rate 1/2 convolutional codes

This paper shows the existence (by construction) of ratefrac{1}{2}convolutional codes that correct bursts of lengthBortrandom errors. The codes have memory length and guard space requirements that are asymptotically4Band minimal effective length. Kohlenberg introduced the term "diffuse code" for his two random-error or single-burst error-correcting codes with minimal effective length and both a memory and guard-space requirement of3B + 1. To this point, there does not seem to be any procedure for finding codes with minimal effective length and guard space requirements asymptotically3B.