Related papers: On defining generalized rank weights
We study G-valued Galois deformation rings with prescribed properties, where G is an arbitrary (not necessarily connected) reductive group over an extension of Z_l for some prime l. In particular, for the Galois groups of p-adic local…
Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…
We introduce a condition for Hopf-Galois extensions that generalizes the notion of Kummer Galois extension. Namely, an $H$-Galois extension $L/K$ is $H$-Kummer if $L$ can be generated by adjoining to $K$ a finite set $S$ of eigenvectors for…
We use the relations between quadrics, trace codes and algebraic curves to construct algebraic curves over finite fields with many points and to compute generalized Hamming weights of codes.
In this paper we address the problem of classification of simple weight modules over weak generalized Weyl algebras of rank one. The principal difference between weak generalized Weyl algebras and generalized weight algebras is that weak…
The goal of this article is to study some basic algebraic and combinatorial properties of "generalized $n$-series" over a commutative ring $R$, which are functions $s: \mathbf{Z}_{\geq 0} \to R$ satisfying a mild condition. A special…
While random linear network coding is a powerful tool for disseminating information in communication networks, it is highly susceptible to errors caused by various sources. Due to error propagation, errors greatly deteriorate the throughput…
To each linear code over a finite field we associate the matroid of its parity check matrix. We show to what extent one can determine the generalized Hamming weights of the code (or defined for a matroid in general) from various sets of…
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,…
We survey some recent progress on generalizations of conjectures of Serre concerning the cohomology of arithmetic groups, focusing primarily on the "weight" aspect. This is intimately related to (generalizations of) a conjecture of Breuil…
First we study some properties of the modular group algebra $\mathbb{F}_{p^r}[G]$ where $G$ is the additive group of a Galois ring of characteristic $p^r$ and $\mathbb{F}_{p^r}$ is the field of $p^r$ elements. Secondly a description of the…
The aim of this work is to give degree formulas for the generalized Hamming weights of evaluation codes and to show lower bounds for these weights. In particular, we give degree formulas for the generalized Hamming weights of…
We consider the question of determining the higher weights or the generalized Hamming weights of affine Grassmann codes and their duals. Several initial as well as terminal higher weights of affine Grassmann codes of an arbitrary level are…
We show that the modular Serre weights of a sufficiently generic mod $p$ Galois representation of an unramified $p$-adic field are themselves generic, and give precise bounds on the genericity, by extending previous work of Emerton, Gee and…
Linear sets over finite fields are central objects in finite geometry and coding theory, with deep connections to structures such as semifields, blocking sets, KM-arcs, and rank-metric codes. Among them, $i$-clubs, a class of linear sets…
We prove that every place of an algebraic function field F|K of arbitrary characteristic admits local uniformization in a finite extension F' of F. We show that F'|F can be chosen to be normal. If K is perfect and P is of rank 1, then…
We study the module of universal norms associated with a de Rham $p$-adic Galois representation in a perfectoid field extension. In particular, we compute precisely this module when the Hodge-Tate weights of a representation are greater…
In this paper, we propose and study $r$-minimal codes, a natural extension of minimal codes which have been extensively studied with respect to Hamming metric, rank metric and sum-rank metric. We first propose $r$-minimal codes in a general…
We introduce a hypergoemetirc series with two complex variables, which generalizes Appell's, Lauricella's and Kemp\'e de F\'eriet's hypergeometric series, and study the system of differential equations that it satisfies. We determine the…
In 2021, Augot, Couvreur, Lavauzelle and Neri introduced a new class of rank metric codes which can be regarded as rank metric counterparts of Reed-Muller codes. Given a finite Galois extension $\mathbb{L} / \mathbb{K}$, these codes are…