Fundamental Notions of Projective and Scale-Translation-Invariant Metrics in Coding Theory
Gabor Riccardi, Hugo Sauerbier Couvée
TL;DR
We address unifying projective metrics on finite-vector spaces by proving that a projective metric is exactly an integral convex scale- and translation-invariant metric and can be realized as a quotient of a Hamming metric via a family of 1-dimensional subspaces. We construct a bijection between isomorphism classes of projective metrics on a space $V$ and the set of Hamming-equivalence classes of parent codes in ${\mathbb F}_q^N$, and show that the projective isometry group equals the stabilizer of the corresponding parent code. We prove existence of embeddings of any finitely-valued scale-invariant metric into a projective metric on a larger space and relate sphere sizes to coset distributions through extended spanning families and an associated matroid, yielding a Singleton-type bound. The work provides extensive examples, a Sage implementation, and sets a foundation for connections among coding theory, matroid theory, graph theory, and finite geometry.
Abstract
Projective metrics on vector spaces over finite fields, introduced by Gabidulin and Simonis in 1997, generalize classical metrics in coding theory like the Hamming metric, rank metric, and combinatorial metrics. While these specific metrics have been thoroughly investigated, the overarching theory of projective metrics has remained underdeveloped since their introduction. In this paper, we present and develop the foundational theory of projective metrics, establishing several elementary key results on their characterizing properties, equivalence classes, isometries, constructions, connections with the Hamming metric, associated matroids, sphere sizes and Singleton-like bounds. Furthermore, some general aspects of scale-translation-invariant metrics are examined, with particular focus on their embeddings into larger projective metric spaces.
