Related papers: On defining generalized rank weights
The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we…
We study the ramification groups of finite Galois extensions $L/K$ of a complete discrete valuation field $K$ of equal characteristic $p>0$ with perfect residue field and Galois group isomorphic to the group of unitriangular matrices…
Given a field $k$ and a finite group $H$, {\it{an $H$-parametric extension over $k$}} is a finite Galois extension of $k(T)$ of Galois group containing $H$ which is regular over $k$ and has all the Galois extensions of $k$ of group $H$…
The Generalized Hamming weights and their relative version, which generalize the minimum distance of a linear code, are relevant to numerous applications, including coding on the wire-tap channel of type II, $t$-resilient functions,…
Linearized Reed-Solomon codes are defined. Higher weight distribution of those codes are determined.
The second weight of the Generalized Reed-Muller code of order $d$ over the finite field with $q$ elements is now known for $d <q$ and $d>(n-1)(q-1)$. In this paper, we determine the second weight for the other values of $d$ which are not…
In this paper, we consider codes over finite fields, finite abelian groups, and finite Frobenius rings. For such codes, the complete weight enumerator and the Hamming weight enumerator serve as powerful tools. These two types of weight…
The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. GHWs are of great interest in many applications since they convey detailed information of linear codes. In this paper, we continue the work of [10] to study…
Weight systems are functions on chord diagrams satisfying Vassiliev's $4$-term relations. They originate in the theory of finite type knot invariants. Recent developments in understanding weight systems arising from Lie algebras are based…
We review the main results of the theory of rank-metric codes, with emphasis on their combinatorial properties. We study their duality theory and MacWilliams identities, comparing in particular rank-metric codes in vector and matrix…
The tensor rank of some Gabidulin codes of small dimension is investigated. In particular, we determine the tensor rank of any rank metric code equivalent to an $8$-dimensional $\mathbb{F}_q$-linear generalized Gabidulin code in…
We use techniques of relative algebraic K-theory to develop a common refinement of the existing theories of metrized and hermitian Galois structures in arithmetic. As a first application of this very general approach, we then use it to…
In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete…
This paper is motivated by the study of Alperin's weight conjecture in the representation theory of finite groups. We generalize the notion of $e$-cuspidality in the $e$-Harish-Chandra theory of finite reductive groups, and define generic…
In the present paper, we introduce the concepts of Jacobi polynomials and intersection enumerators of codes over $\mathbb{F}_q$ and $\mathbb{Z}_{k}$ for arbitrary genus $g$. We also discuss the interrelation among them. Finally, we give the…
In this paper, based on the theory of defining sets, a class of four-weight or five-weight linear codes over Fp is constructed. The complete weight enumerators of the linear codes are determined by means of Weil sums. In some case, there is…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
We compute the Z-rank of the subgroup of elements of the multiplicative group of a number field K that are norms from every finite level of the cyclotomic Z{\ell}-extension of K. Thus we compare its {\ell}-adification with the group of…
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…
In this paper we give an explicit solution to the rank constrained matrix approximation in Frobenius norm, which is a generalization of the classical approximation of an m by n matrix A by a matrix of rank k at most.