Minimal nontrivial solutions of the isometry equation
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.