Related papers: Optimal Rank-Metric Codes with Rank-Locality from …
In this article we construct a new family of linear maximum rank distance (MRD) codes for all parameters. This family contains the only known family for general parameters, the Gabidulin codes, and contains codes inequivalent to the…
We investigate two fundamental questions intersecting coding theory and combinatorial geometry, with emphasis on their connections. These are the problem of computing the asymptotic density of MRD codes in the rank metric, and the Critical…
Maximum rank-distance (MRD) codes are extremal codes in the space of $m\times n$ matrices over a finite field, equipped with the rank metric. Up to generalizations, the classical examples of such codes were constructed in the 1970s and are…
Recent studies have delved into the construction of locally repairable codes (LRCs) with optimal minimum distance from function fields. In this paper, we present several novel constructions by extending the findings of optimally designed…
Drinfeld's lemma is a powerful tool for splitting $\ell$-adic local systems defined over a product of connected schemes over a finite field. In this paper, we show that Drinfeld's lemma also holds true for algebraic stacks.
Let $F$ be a function field over $\mathbb{F}_q$, $A$ its ring of regular functions outside a place $\infty$ and $\mathfrak{p}$ a prime ideal of $A$. First, we develop Hida theory for Drinfeld modular forms of rank $r$ which are of slope…
We show that the module of Stark units associated to a sign-normalized rank one Drinfeld module can be obtained from Anderson's equivariant $A$-harmonic series. We apply this to obtain a class formula \`a la Taelman and to prove a several…
In this work we describe the local cohomology of reflexive modules of rank one over normal semigroup rings with respect to monomial ideals. Using our description we show that the problem of classifying maximal Cohen-Macaulay modules of rank…
We introduce the class of rank-metric geometric lattices and initiate the study of their structural properties. Rank-metric lattices can be seen as the $q$-analogues of higher-weight Dowling lattices, defined by Dowling himself in 1971. We…
In this paper we introduce a new class of extremal codes, namely the $i$-BMD codes. We show that for this family several of the invariants are determined by the parameters of the underlying code. We refine and extend the notion of an…
MRD codes are maximum codes in the rank-distance metric space on $m$-by-$n$ matrices over the finite field of order $q$. They are diameter perfect and have the cardinality $q^{m(n-d+1)}$ if $m\ge n$. We define switching in MRD codes as…
We study modular polynomials classifying cyclic isogenies between Drinfeld modules of arbitrary rank over the ring F_q[T].
We study both the Riemannian and Lorentzian Calder\'on problem when a family of Dirichlet-to-Neumann maps are given for an open set of magnetic/electromagnetic potentials. For the Riemannian version, by allowing small perturbations of the…
We give a global description of the Frobenius elements in the division fields of Drinfeld modules of rank $2$. We apply this description to derive a criterion for the splitting modulo primes of a class of non-solvable polynomials, and to…
We study metric Diophantine approximation in local fields of positive characteristic. Specifically, we study the problem of improving Dirichlet's theorem in Diophantine approximation and prove very general results in this context.
Introduced by Angl\`{e}s, Pellarin, and Tavares Ribeiro, Drinfeld modules over Tate algebras are closely connected to Anderson log-algebraicity identities, Pellarin $L$-series, and Taelman class modules. In the present paper we define the…
Gabidulin codes, serving as the rank-metric counterpart of Reed-Solomon codes, constitute an important class of maximum rank distance (MRD) codes. However, unlike the fruitful positive results about the list decoding of Reed-Solomon codes,…
Maximum Hermitian rank metric codes were introduced by Schmidt in 2018 and in this paper we propose both interpolation-based encoding and decoding algorithms for this family of codes when the length and the minimum distance of the code are…
Let $k$ be a global field, let $A$ be a Dedekind domain with $\text{Quot}(A) = k$, and let $K$ be a finitely generated field. Using a unified approach for both elliptic curves and Drinfeld modules $M$ defined over $K$ and having a trivial…
In this paper we construct new optimal hierarchical locally recoverable codes. Our construction is based on a combination of the ideas of \cite{ballentine2019codes,sasidharan2015codes} with an algebraic number theoretical approach that…