Related papers: On defining generalized rank weights
By a generalized Delsarte polynomial we mean a Laurent polynomial whose exponent vectors are linearly independent. We consider certain monomial deformations of generalized Delsarte polynomials and study their associated differential…
Let K be a cyclic Galois extension of degree f over k and T a generator of the Galois group. For any v=(v_1,... , v_m)\in K^m such that v is linearly independent over k, and any 0< d < m the Gabidulin-like code C(v, T , d) is a maximum rank…
There are many notions of rank in multilinear algebra: tensor rank, partition rank, slice rank, and strength (or Schmidt rank) are a few examples. Typically the rank $\le r$ locus is not Zariski closed, and understanding the closure (the…
We generalize a result of F.\ Legrand about the existence of non-parametric Galois extensions for a given group $G$. More precisely, for a $K$-regular Galois extension $F|K(t)$, we consider the translates $F(s)|K(s)$ by an extension…
We introduce what we call `generalized higher rank $k$-graphs' as a class of categories equipped with a notion of size. They extend not only the higher rank $k$-graphs, but also the Levi categories introduced by the first author as a…
Given fields $k \subseteq L$, our results concern one parameter $L$-parametric polynomials over $k$, and their relation to generic polynomials. The former are polynomials $P(T,Y) \in k[T][Y]$ of group $G$ which parametrize all Galois…
We define a class of automorphisms of rational function fields of finite characteristic and employ these to construct different types of optimal linear rank-metric codes. The first construction is of generalized Gabidulin codes over…
Generalized pair weights of linear codes are generalizations of minimum symbol-pair weights, which were introduced by Liu and Pan \cite{LP} recently. Generalized pair weights can be used to characterize the ability of protecting information…
This paper presents an algorithm for decoding homogeneous interleaved codes of high interleaving order in the rank metric. The new decoder is an adaption of the Hamming-metric decoder by Metzner and Kapturowski (1990) and guarantees to…
Linear codes with a few weights have important applications in authentication codes, secret sharing, consumer electronics, etc.. The determination of the parameters such as Hamming weight distributions and complete weight enumerators of…
We prove some existence results on parameterized strongly normal extensions for logarithmic equations. We generalize a result in [Wibmer, Existence of d-parameterized Picard-Vessiot extensions over fields with algebraically closed…
(Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is…
In this paper, we present a generalization of Hayden's theorem [7, Theorem 4.2] for $G$-codes over finite Frobenius rings. A lattice theoretical form of this generalization is also given. Moreover, Astumi's MacWilliams identity [1, Theorem…
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. These…
In analogy with the Singleton defect for classical codes, we propose a definition of rank defect for Delsarte rank-metric codes. We characterize codes whose rank defect and dual rank defect are both zero, and prove that the rank…
For a growing number of applications such as cellular, peer-to-peer, and sensor networks, efficient error-free transmission of data through a network is essential. Toward this end, K\"{o}tter and Kschischang propose the use of subspace…
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…
By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…
We consider the decoding of rank metric codes assuming the error matrix is symmetric. We prove two results. First, for rates $<1/2$ there exists a broad family of rank metric codes for which any symmetric error pattern, even of maximal rank…
We consider codes over $\mathbb{Z}_{p^s}$ with the extended Lee weight. We find Singleton bounds with respect to this weight and define MLDS and MLDR codes accordingly. We also consider the kernels of these codes and the notion of…