Related papers: MacWilliams' Extension Theorem for rank-metric cod…
A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown to be a Fourier…
This paper examines the $w$-weight enumerators of weights $w$ with maximal symmetry over finite chain rings and matrix rings over finite fields. In many cases, including the homogeneous weight, the MacWilliams identities for $w$-weight…
McMullen's g-vector is important for simple convex polytopes. This paper postulates axioms for its extension to general convex polytopes. It also conjectures that, for each dimension d, a stated finite calculation gives the formula for the…
Rank-metric codes, defined as sets of matrices over a finite field with the rank distance, have gained significant attention due to their applications in network coding and connections to diverse mathematical areas. Initially studied by…
In this paper we provide a large family of rank-metric codes, which contains properly the codes recently found by Longobardi and Zanella (2021) and by Longobardi, Marino, Trombetti and Zhou (2021). These codes are…
An extension $(V,d)$ of a metric space $(S,\mu)$ is a metric space with $S \subseteq V$ and $d|_S = \mu$, and is said to be tight if there is no other extension $(V,d')$ of $(S,\mu)$ with $d' \leq d$. Isbell and Dress independently found…
Employing isomorphisms between their ambient rings, we propose new definitions of equivalence and isometry for skew polycyclic codes that will lead to tighter classifications than existing ones. This reduces the number of previously known…
Generalized pair weights of linear codes are generalizations of minimum symbol-pair weights, which were introduced by Liu and Pan \cite{LP} recently. Generalized pair weights can be used to characterize the ability of protecting information…
The aim of this work is to generalize the ultraholomorphic extension theorems from V. Thilliez in the weight sequence setting and from the authors in the weight function setting (of Roumieu type) to a mixed framework. Such mixed results…
We study perfect codes in the sum-rank metric, a generalization of both the Hamming and rank metrics relevant in multishot network coding and space-time coding. A perfect code attains equality in the sphere-packing bound, corresponding to a…
This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for subspace codes. A conjecture from 2009 provides an upper bound for the dimension…
The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…
The notion of the ultrametrics can be considered as a zero-dimensional analogue of ordinary metrics, and it is expected to prove ultrametric versions of theorems on metric spaces. In this paper, we provide ultrametric versions of the…
In the realm of rank-metric codes, Maximum Rank Distance (MRD) codes are optimal algebraic structures attaining the Singleton-like bound. A major open problem in this field is determining whether an MRD code can be extended to a longer one…
The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…
The paper contains theorems on extending sections of line bundles from divisors to the ambient space, inspired by various results of Siu, Kawamata, and especially Hacon-McKernan and Takayama. Applications are given to basepoint-freeness, to…
In this paper the ensemble of codes formed by a serial concatenation of a repetition code with multiple accumulators connected through random interleavers is considered. Based on finite length weight enumerators for these codes, asymptotic…
We consider the problem of describing the typical (possibly) non-linear code of minimum distance bounded from below over a large alphabet. We concentrate on block codes with the Hamming metric and on subspace codes with the injection…
In this paper we study codes where the alphabet is a finite Frobenius bimodule over a finite ring. We discuss the extension property for various weight functions. Employing an entirely character-theoretic approach and a duality theory for…
We investigate the possibility of semigroup extensions of the isometry group of an identification space, in particular, of a compactified spacetime arising from an identification map $p: \RR^n_t \to \RR^n_t / \Gamma$, where $\RR^n_t$ is a…