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 first interesting case of k = 3, it is shown that many of the codes obtained via projective geometry tecqniques can readily be obtained via the proposed algebraic approach. ) 0 T ec hn io n C om pu te r Sc ie nc e D ep ar tm en t T eh ...
