Generalized Reed-Solomon codes and twisted generalized Reed-Solomon codes provide important sources of maximum distance separable codes. In this paper, we study two variants obtained by introducing column twists and simultaneous row-column twists into Reed-Solomon-type evaluation codes. For the column-twisted family, we provide necessary and sufficient conditions for the code to be MDS in terms of explicit subset product conditions. Under the stated parameter assumptions, the Schur square has dimension 2k+1, which leads to MDS codes that are not equivalent to Reed-Solomon codes. For the row-column twisted family, we establish necessary and sufficient conditions for the MDS property in terms of elementary symmetric functions. The larger Schur-square dimension provides a further distinction from both Reed-Solomon codes and known twisted families, thereby yielding new non-RS MDS codes. Finally, explicit parity-check matrices and dual descriptions are obtained for both code families. These results provide a foundation for subsequent studies of self-orthogonality, hull dimensions, and applications to quantum-code constructions.

翻译：暂无翻译