Related papers: Higher-degree symmetric rank-metric codes
Intersecting codes are a classical object in coding theory whose rank-metric analogue has recently been introduced. Although the definition formally parallels the Hamming-metric case, the structure and parameter constraints of rank-metric…
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…
In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. We then use elementary linear subspaces to derive properties of maximum rank distance (MRD) codes…
A class of linear block codes which simultaneously generalizes Gabidulin codes and a class of skew cyclic codes is defined. For these codes, both a Hartmann-Tzeng-like bound and a Roos-like bound, with respect to their rank distance, are…
We investigate punctured maximum rank distance codes in cyclic models for bilinear forms of finite vector spaces. In each of these models we consider an infinite family of linear maximum rank distance codes obtained by puncturing…
In this paper we provide a large family of rank-metric codes, which contains properly the codes recently found by Longobardi and Zanella (2021) and by Longobardi, Marino, Trombetti and Zhou (2021). These codes are…
Polynomials with values in an irreducible module of the symmetric group can be given the structure of a module for the rational Cherednik algebra, called a standard module. This algebra has one free parameter and is generated by…
This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…
In this paper, we investigate the rank-metric codes which are proposed by Delsarte and Gabidulin to be complementary dual codes. We point out the relationship between Delsarte complementary dual codes and Gabidulin complementary dual codes.…
Gabidulin codes are the rank-metric analogs of Reed-Solomon codes and have a major role in practical error control for network coding. This paper presents new encoding and decoding algorithms for Gabidulin codes based on low-complexity…
In Linear Algebra over finite fields, a characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold…
We study the maximal rank in affine subspaces of symmetric or alternating matrices, in terms of the matching numbers of certain associated graphs. Applications include simple proofs of upper bounds on the dimension of such subspaces in…
MRD codes are maximum codes in the rank-distance metric space on $m$-by-$n$ matrices over the finite field of order $q$. They are diameter perfect and have the cardinality $q^{m(n-d+1)}$ if $m\ge n$. We define switching in MRD codes as…
In the recent years, the notion of rank metric in the context of coding theory has known many interesting developments in terms of applications such as space time coding, network coding or public key cryptography. These applications raised…
In this paper we study the rigidity of proper holomorphic maps $f\colon \Omega\to\Omega'$ between irreducible bounded symmetric domains $\Omega$ and $\Omega'$ with small rank differences: $2\leq \text{rank}(\Omega')<…
We prove that for many ranks r<2m-2, random rank r mixed states in bipartite mxm systems have relatively high Schmidt numbers, which is based on algebraic-geometric separability criterion proved in [1]. This also means that the…
This paper extends the study of rank-metric codes in extension fields $\mathbb{L}$ equipped with an arbitrary Galois group $G = \mathrm{Gal}(\mathbb{L}/\mathbb{K})$. We propose a framework for studying these codes as subspaces of the group…
There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…
We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…
In this paper, we introduce higher rank generalizations of Macdonald polynomials. The higher rank non-symmetric Macdonald polynomials are Laurent polynomials in several sets of variables which form weight bases for higher rank polynomial…