On Euclidean self-dual codes and isometry codes.

In this paper, we provide new methods and algorithms to construct Euclidean self-dual codes over large finite fields. With the existence of a dual basis, we study dual preserving linear maps, and as an application, we use them to construct self-orthogonal codes over small finite prime fields using the method of concatenation. Many new optimal self-orthogonal and self-dual codes are obtained. [ABSTRACT FROM AUTHOR]