Euclidean and Hermitian self-dual MDS codes over large finite fields. (Q1427010)

A self-dual code is a code satisfying \(C=C^\perp\). It is called Euclidean or Hermitian based on which inner-product is used. MDS codes satisfy \(d=n-k+1\) where \(d\) is the minimum Hamming weight, \(n\) is the length of the code and \(k\) is the dimension. The authors use a known technique generalized to these cases to produce self-dual MDS codes and self-dual codes which are almost MDS over large finite fields.