Minimal nontrivial solutions of the isometry equation
Serhii Dyshko
TL;DR
This paper characterizes the minimal nontrivial solutions of the isometry equation, which are crucial for understanding unextendible additive code isometries in coding theory, providing a comprehensive description and properties.
Contribution
It provides a complete description of minimal nontrivial solutions of the isometry equation and explores their properties in coding theory.
Findings
Characterization of minimal nontrivial solutions
Identification of properties of these solutions
Relevance to unextendible additive isometries
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation