We derive lower bounds on the distance and error exponent of the coding sch
eme described in the title. The bounds are compared to the parameters and e
rror performance of a concatenated code family with varying inner codes of
equal rates and a fixed minimum-distance separable (MDS) code as the outer
code, letting the inner and outer code lengths approach infinity.