Search for good b/(b+1) high rate recursive systematic convolutional component codes

A simplified search for good recursive systematic convolution codes with rate b/(b+1) is proposed, to be used as component codes in very high rate, parallel concatenated turbo codes. The first optimised parameter is the effective free-distance of turbo codes. The results obtained are compared to known bounds and previously published results where available.