English
Related papers

Related papers: On defining generalized rank weights

200 papers

The finite Grassmannian $\mathcal{G}_{q}(k,n)$ is defined as the set of all $k$-dimensional subspaces of the ambient space $\mathbb{F}_{q}^{n}$. Subsets of the finite Grassmannian are called constant dimension codes and have recently found…

Information Theory · Computer Science 2014-06-20 Joachim Rosenthal , Natalia Silberstein , Anna-Lena Trautmann

We investigate the maximum number \( L_{\mathrm{rk}}(n, m, k, q) \) of distinct nonzero rank weights that an \( \mathbb{F}_{q^m} \)-linear rank-metric code of dimension \( k \) in \( \mathbb{F}_{q^m}^n \) can attain. We determine the exact…

Combinatorics · Mathematics 2025-12-16 Chiara Castello , Paolo Santonastaso , Martin Scotti

This paper investigates the relationship between the rank weight distribution of a linear code and that of its dual code. The main result of this paper is that, similar to the MacWilliams identity for the Hamming metric, the rank weight…

Information Theory · Computer Science 2007-07-13 Maximilien Gadouleau , Zhiyuan Yan

For a smooth group scheme $G$ over an extension of $\mathbf{Z}_p$ such that the generic fiber of $G$ is reductive, we study the generic fiber of the Galois deformation ring for a $G$-valued mod $p$ representation of the absolute Galois…

Number Theory · Mathematics 2020-03-27 Jeremy Booher , Stefan Patrikis

The generalized metric is a T-duality covariant symmetric matrix constructed from the metric and two-form gauge field and arises in generalized geometry. We view it here as a metric on the doubled spacetime and use it to give a simple…

High Energy Physics - Theory · Physics 2014-11-21 Olaf Hohm , Chris Hull , Barton Zwiebach

Generalized twisted Gabidulin codes are one of the few known families of maximum rank matrix codes over finite fields. As a subset of m by n matrices, when m=n, the automorphism group of any generalized twisted Gabidulin code has been…

Combinatorics · Mathematics 2019-04-16 Rocco Trombetti , Yue Zhou

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…

Information Theory · Computer Science 2017-11-01 Alberto Ravagnani

We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…

Number Theory · Mathematics 2025-04-24 Fabrice Etienne

D. G. Higman generalized a coherent configuration and defined a weight. In this article, we will modify the definition and investigate weights on coherent configurations. If our weights are on a thin homogeneous coherent configuration, that…

Combinatorics · Mathematics 2025-12-16 Akihide Hanaki

Recently, Bhaintwal and Wasan studied the Generalized Reed-Muller codes over the prime power integer residue ring. In this paper, we give a generalization of these codes to Generalized Reed-Muller codes over Galois rings.

Information Theory · Computer Science 2018-01-17 Harinaivo Andriatahiny , Desiré Arsène Ratahirinjatovo , Sanni José Andrianalisefa

Projective metrics on vector spaces over finite fields, introduced by Gabidulin and Simonis in 1997, generalize classical metrics in coding theory like the Hamming metric, rank metric, and combinatorial metrics. While these specific metrics…

Metric Geometry · Mathematics 2025-05-13 Gabor Riccardi , Hugo Sauerbier Couvée

The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an $\mathbb{F}_q$-linear rank-metric code over $\mathbb{F}_q^{m \times n}$ of rate $R =…

Computational Complexity · Computer Science 2017-11-01 Venkatesan Guruswami , Nicolas Resch

This paper investigates the relation between linear codes and the stabilizer in ${\rm GL}_2(\mathbb{C})$ of their weight enumerators. We prove a result on the finiteness of stabilizers and give a complete classification of linear codes with…

Information Theory · Computer Science 2017-07-05 Martino Borello , Olivier Mila

For a block B of a finite group G there are well-known orthogonality relations for the generalized decomposition numbers. We refine these relations by expressing the generalized decomposition numbers with respect to an integral basis of a…

Representation Theory · Mathematics 2015-11-23 Benjamin Sambale

We describe the higher weights of the Grassmann codes $G(2,m)$ over finite fields ${\mathbb F}_q$ in terms of properties of Schubert unions, and in each case we determine the weight as the minimum of two explicit polynomial expressions in…

Algebraic Geometry · Mathematics 2011-05-04 Sudhir R. Ghorpade , Trygve Johnsen , Arunkumar R. Patil , Harish K. Pillai

We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all i=k+1,...,n, we give an upper bound on the smallest integer m…

Information Theory · Computer Science 2015-10-05 Trygve Johnsen , Keisuke Shiromoto , Hugues Verdure

We compare the two duality theories of rank-metric codes proposed by Delsarte and Gabidulin, proving that the former generalizes the latter. We also give an elementary proof of MacWilliams identities for the general case of Delsarte…

Information Theory · Computer Science 2015-04-03 Alberto Ravagnani

We present a generalization of Galois descent to finite modular normal field extension $L/K$, using the Heerma-Galois group $Aut(L[\bar{X}]/K[\bar{X}])$ where $L[\bar{X}]=L[X]/(X^{p^e})$ and $e$ is the exponent of $L$ over $K$.

Algebraic Geometry · Mathematics 2015-10-23 Giulia Battiston

In \cite{GQ2008} R. Gow and R. Quinlan have cast a new look on the endomorphism algebra of a $K$-vector space $V$ of dimension $n$ assuming that $K$ has a Galois extension $L$ of degree $n$. In this approach the $K$-space $L$ may serve as a…

Representation Theory · Mathematics 2024-05-29 Ashish Gupta , Sugata Mandal

Gleason's 1970 theorem on weight enumerators of self-dual codes has played a crucial role for research in coding theory during the last four decades. Plenty of generalizations have been proved but, to our knowledge, they are all based on…

Information Theory · Computer Science 2018-11-15 Martino Borello , Olivier Mila