Related papers: Non-minimum tensor rank Gabidulin codes
In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative…
The definition of subshifts of finite symbolic rank is motivated by the finite rank measure-preserving transformations which have been extensively studied in ergodic theory. In this paper we study subshifts of finite symbolic rank as…
This work investigates the structure of rank-metric codes in connection with concepts from finite geometry, most notably the $q$-analogues of projective systems and blocking sets. We also illustrate how to associate a classical…
The tensor rank decomposition is a useful tool for the geometric interpretation of the tensors in the canonical tensor model (CTM) of quantum gravity. In order to understand the stability of this interpretation, it is important to be able…
Recently, simplicial complexes are used in constructions of several infinite families of minimal and optimal linear codes by Hyun {\em et al.} Building upon their research, in this paper more linear codes over the ring $\mathbb{Z}_4$ are…
For tensors of fixed order, we establish three types of upper bounds for the geometric rank in terms of the subrank. Firstly, we prove that, under a mild condition on the characteristic of the base field, the geometric rank of a tensor is…
In this work, we modify the decoding algorithm for subspace codes by Koetter and Kschischang to get a decoding algorithm for (generalized) twisted Gabidulin codes. The decoding algorithm we present applies to cases where the code is linear…
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…
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…
For a given symmetric tensor, we aim at finding a new one whose symmetric rank is small and that is close to the given one. There exist linear relations among the entries of low rank symmetric tensors. Such linear relations can be expressed…
This paper investigates the generalized rank weights, with a definition implied by the study of the generalized rank weight enumerator. We study rank metric codes over $L$, where $L$ is a finite Galois extension of a field $K$. This is a…
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…
We develop a symbolic computational approach to classifying low-rank modular categories. We use this technique to classify pseudo-unitary modular categories of rank at most 5 that are non-self-dual, i.e. those for which some object is not…
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 =…
We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum…
By the results of the author and Chiantini in Math.AG/0110102, on a general quintic threefold $X \subset {\mathbf P}^4$ the minimum integer $p$ for which there exists a positive dimensional family of irreducible rank $p$ vector bundles on…
In [A. Neri, P. Santonastaso, F. Zullo. Extending two families of maximum rank distance codes], the authors extended the family of $2$-dimensional $\mathbb{F}_{q^{2t}}$-linear MRD codes recently found in [G. Longobardi, G. Marino, R.…
We address the problem of decoding Gabidulin codes beyond their unique error-correction radius. The complexity of this problem is of importance to assess the security of some rank-metric code-based cryptosystems. We propose an approach that…
In various application fields, tensor type data are used recently and then a typical rank is important. Although there may be more than one typical ranks over the real number field, a generic rank over the complex number field is the…
Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite dimension and minimum…