Concatenated codes with convolutional inner codes

The minimum distance of concatenated codes with Reed-Solomon outer codes and convolutional inner codes is studied. For suitable combinations of parameters the minimum distance can be lower-bounded by the product of the minimum distances of the inner and outer codes. For a randomized ensemble of concatenated codes a lower bound of the Gilbert-Varshamov type is proved