Composition of Reed-Solomon codes and geometric designs
Ron M. Roth, Abraham Lempel · IEEE Transactions on Information Theory · 1988
It is shown that good linear (n,k,d) codes over a finite field GF(q) can be constructed by concatenating the generator matrices of Reed-Solomon codes. For the case of k=3, it is shown that many of the codes obtained using projective-geometry techniques can readily be obtained by the proposed algebraic approach.>