Let denote an -dimensional vector space over , the finite field of elements. Then is also an -dimension vector space over . An -subspace of is -evasive if it meets the -dimensional -subspaces of in -subspaces of dimension at most . The -evasive subspaces are known as scattered and they have been intensively studied in finite geometry, their maximum size has been proved to be when is even or . We investigate the maximum size of -evasive subspaces, study two duality relations among them and provide various constructions. In particular, we present the first examples, for infinitely many values of , of maximum scattered subspaces when and . We obtain these examples in characteristics 2, 3 and 5.
1 January 2023 in Advances in Mathematics of Communications
UCUniversità degli Studi di Napoli Federico Ii Dipartimento di Matematica e Applicazioni Renato Caccioppoli
Università degli Studi di Napoli Federico Ii Dipartimento di Matematica e Applicazioni Renato Caccioppoli
+1
In the context of constant-dimension subspace codes, an important problem is to determine the largest possible size $ A_q(n, d; k) $ of codes whose codewords are $ k $-subspaces of $ {\mathbb F}_q^n $ with minimum subspace distance $ d $. Here in order to obtain improved constructions, we investigate several approaches to combine subspace codes. This allow us to present improvements on the lower bounds for constant-dimension subspace codes for many parameters, including $ A_q(10, 4; 5) $, $ A_q(12, 4; 4) $, $ A_q(12, 6, 6) $ and $ A_q(16, 4; 4) $.
1 April 2020 in Linear Algebra and its Applications
Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated q-system. Using this result, we provide the first construction of a family of $$\mathbb F_{q^m}$$ -linear MRD codes of length 2m that are not obtained as a direct sum of two smaller MRD codes. In addition, such a family has better parameters, since its codes possess generalized rank weights strictly larger than those of the previously known MRD codes. This shows that not all the MRD codes have the same generalized rank weights, in contrast to what happens in the Hamming metric setting.