On MSR Subspace Families of Lines

05/05/2023
by   Ferdinand Ihringer, et al.
0

A minimum storage regenerating (MSR) subspace family of 𝔽_q^2m is a set 𝒮 of m-spaces in 𝔽_q^2m such that for any m-space S in 𝒮 there exists an element in PGL(2m, q) which maps S to itself and fixes 𝒮∖{ S } pointwise. We show that an MSR subspace family of 2-spaces in 𝔽_q^4 has at most size 6 with equality if and only if it is a particular subset of a Segre variety. This implies that an (n, n-2, 4)-MSR code has n ≤ 9.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/26/2021

Cyclic subspace codes via the sum of Sidon spaces

Subspace codes, especially cyclic constant subspace codes, are of great ...
research
11/12/2018

Subspace Packings

The Grassmannian G_q(n,k) is the set of all k-dimensional subspaces of ...
research
05/25/2023

New constructions of cyclic subspace codes

A subspace of a finite field is called a Sidon space if the product of a...
research
03/23/2022

Modules in Robinson Spaces

A Robinson space is a dissimilarity space (X,d) (i.e., a set X of size n...
research
08/25/2020

The Index of Invariance and its Implications for a Parameterized Least Squares Problem

We study the problem x_b,ω := arg min_x ∈𝒮(A + ω I)^-1/2 (b - Ax)_2, wit...
research
07/03/2020

Almost Affinely Disjoint Subspaces

In this work, we introduce a natural notion concerning vector finite spa...
research
05/16/2020

Reconstruction of Multi-user Binary Subspace Chirps

We consider codebooks of Complex Grassmannian Lines consisting of Binary...

Please sign up or login with your details

Forgot password? Click here to reset