Related papers: Harder-Narasimhan theory for linear codes
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to show, interpreting the following notions appropriately, that if…
We use the framework of Morse theory with differential graded coefficients to study certain operations on the total space of a fibration. More particularly, we focus in this paper on a chain-level description of the Chas-Sullivan product on…
We study the derived category of pseudo-coherent complexes over a noetherian commutative ring, building on prior work by Matsui-Takahashi. Our main theorem is a computation of the Balmer spectrum of this category in the case of a discrete…
We introduce a general class of regular weight functions on finite abelian groups, and study the combinatorics, the duality theory, and the metric properties of codes endowed with such functions. The weights are obtained by composing a…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
We describe how to glue prime-to-$p$ torsion sheaves along Harder-Narasimhan strata of Fargues-Scholze's $\mathrm{Bun}_G$ in terms of the cohomology of locally closed strata inside the smooth charts $\mathcal{M}_b \to \mathrm{Bun}_G$…
We consider the issue of correspondence between symmetries and conserved quantities in the class of linear relativistic higher-derivative theories of derived type. In this class of models the wave operator is a polynomial in another…
An algebraic theory of dualities is developed based on the notion of bond algebras. It deals with classical and quantum dualities in a unified fashion explaining the precise connection between quantum dualities and the low temperature…
We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions…
We study linear codes over Gaussian integers equipped with the Mannheim distance. We develop Mannheim-metric analogues of several classical bounds. We derive an explicit formula for the volume of Mannheim balls, which yields a sphere…
Given two arbitrary vector bundles on the Fargues-Fontaine curve, we give an explicit criterion in terms of Harder-Narasimhan polygons on whether they realize a semistable vector bundle as their extensions. Our argument is largely…
This work presents a non-linear extension of the high-order discretisation framework based on the Variational Multiscale (VMS) method previously introduced for steady linear problems. We build on the concept of an optimal projector defined…
Solving linear systems of equations plays a fundamental role in numerous computational problems from different fields of science. The widespread use of numerical methods to solve these systems motivates investigating the feasibility of…
We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC…
The determination of weight distribution of cyclic codes involves evaluation of Gauss sums and exponential sums. Despite of some cases where a neat expression is available, the computation is generally rather complicated. In this note, we…
It is well known that there is a deep relationship between codes and lattices. Concepts from coding theory are related to concepts of lattice theory as, for example, weight enumerators to theta series, MacWilliams identity to Jacobi…
We introduce a notion of code sparsification that generalizes the notion of cut sparsification in graphs. For a (linear) code $\mathcal{C} \subseteq \mathbb{F}_q^n$ of dimension $k$ a $(1 \pm \epsilon)$-sparsification of size $s$ is given…
A central topic in mathematical logic is the classification of theorems from mathematics in hierarchies according to their logical strength. Ideally, the place of a theorem in a hierarchy does not depend on the representation (aka coding)…
In this work, linearized multivariate skew polynomials over division rings are introduced. Such polynomials are right linear over the corresponding centralizer and generalize linearized polynomial rings over finite fields, group rings or…
We show that the tensor product of two random linear codes is robustly testable with high probability. This implies that one can obtain pairs of linear codes such that their product and the product of their dual codes are simultaneously…