Related papers: Optimal Rank-Metric Codes with Rank-Locality from …
We obtain new asymptotical bounds for the symmetric tensor rank of multiplication in any finite extension of any finite field $\F_q$. In this aim, we use the symmetric Chudnovsky-type generalized algorithm applied on a family of Shimura…
We consider rank modulation codes for flash memories that allow for handling arbitrary charge-drop errors. Unlike classical rank modulation codes used for correcting errors that manifest themselves as swaps of two adjacently ranked…
We introduce a certain family of Drinfeld modules that we propose as analogues of the Legendre normal form elliptic curves. We exhibit explicit formulas for a certain period of such Drinfeld modules as well as formulas for the supersingular…
In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the…
In 1999, Xing, Niederreiter and Lam introduced a generalization of AG codes using the evaluation at non-rational places of a function field. In this paper, we show that one can obtain a locality parameter $r$ in such codes by using only…
We reduce the problem of constructing asymptotically good tree codes to the construction of triangular totally nonsingular matrices over fields with polynomially many elements. We show a connection of this problem to Birkhoff interpolation…
A family of distance-optimal LRC codes from certain subcodes of $q$-ary Reed-Solomon codes, proposed by I.~Tamo and A.~Barg in 2014, assumes that the code length $n$ is a multiple of $r+1.$ By shortening codes from this family, we show that…
This paper presents a unified analysis framework that captures recent advances in the study of local-optimality characterizations for codes on graphs. These local-optimality characterizations are based on combinatorial structures embedded…
For any admissible value of the parameters $n$ and $k$ there exist $[n,k]$-Maximum Rank distance ${\mathbb F}_q$-linear codes. Indeed, it can be shown that if field extensions large enough are considered, almost all rank distance codes are…
We address the problem of estimating a high-dimensional matrix from linear measurements, with a focus on designing optimal rank-adaptive algorithms. These algorithms infer the matrix by estimating its singular values and the corresponding…
Let $\mathrm{Sym}_q(m)$ be the space of symmetric matrices in $\mathbb{F}_q^{m\times m}$. A subspace of $\mathrm{Sym}_q(m)$ equipped with the rank distance is called a symmetric rank-metric code. In this paper we study the covering…
We construct a compactification of the moduli space of Drinfeld modules of rank $r$ and level $N$ as a moduli space of $A$-reciprocal maps. This is closely related to the Satake compactification, but not exactly the same. The construction…
In this paper, we formulate the Drinfeld module analogue of a question raised by Lang and studied by Katz on the existence of rational points on abelian varieties over number fields. Given a maximal ideal $\fl$ of $\F_q[T]$, the question…
We study error-correcting codes for permutations under the infinity norm, motivated by a novel storage scheme for flash memories call rank modulation. In this scheme, a set of $n$ flash cells are combined to create a single virtual…
We introduce and study a natural class of Anderson t- modules, called triangular t-modules, characterized by having Drinfeld modules as their $\tau$-composition factors. They form a homologically meaningful generalization of Drinfeld…
In this paper, we investigate geometrical properties of the rank metric space and covering properties of rank metric codes. We first establish an analytical expression for the intersection of two balls with rank radii, and then derive an…
Block full rank pencils introduced in [Dopico et al., Local linearizations of rational matrices with application to rational approximations of nonlinear eigenvalue problems, Linear Algebra Appl., 2020] allow us to obtain local information…
We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…
A code over a finite field is called locally recoverable code (LRC) if every coordinate symbol can be determined by a small number (at most r, this parameter is called locality) of other coordinate symbols. For a linear code with length n,…
Over fields of characteristic zero, we determine all absolutely irreducible Yetter-Drinfeld modules over groups that have prime dimension and yield a finite-dimensional Nichols algebra. To achieve our goal, we introduce orders of braided…