  In the paper there are described minimal nontrivial solutions of the isometry
equation. This equation naturally appears in the coding theory in the study of
additive code isometries. The minimal nontrivial solutions correspond to the
case of unextendible additive isometries of the shortest code length. Based on
this full description, several useful properties of minimal nontrivial
solutions were observed.
