Problems of isomorphy concerning the algebraic representation of affine MDS-codes. (Q2718781)

An affine MDS code of length \(n\) over a \(q\)-ary alphabet is defined as having \(q^2\) words and minimum Hamming distance \(n-1\). The author defines the concept of a ``partial quasi-ternary''. He constructs affine MDS codes from partial quasi-ternaries and vice versa. After introducing concepts of isomorphy for partial quasi-ternaries, links are established between the isometries of affine MDS codes and the corresponding partial quasi-ternaries, and vice versa.