On MSRD codes, h-designs and disjoint maximum scattered linear sets

08/01/2023
by   Paolo Santonastaso, et al.
0

In this paper we study geometric aspects of codes in the sum-rank metric. We establish the geometric description of generalised weights, and analyse the Delsarte and geometric dual operations. We establish a correspondence between maximum sum-rank distance codes and h-designs, extending the well-known correspondence between MDS codes and arcs in projective spaces and between MRD codes and h-scatttered subspaces. We use the geometric setting to construct new h-designs and new MSRD codes via new families of pairwise disjoint maximum scattered linear sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2021

Twisted Linearized Reed-Solomon Codes: A Skew Polynomial Framework

We provide an algebraic description for sum-rank metric codes, as quotie...
research
01/27/2020

Connections between scattered linear sets and MRD-codes

The aim of this paper is to survey on the known results on maximum scatt...
research
10/11/2022

New infinite families of near MDS codes holding t-designs and optimal locally recoverable codes

Linear codes with parameters [n,k,n-k] are called almost maximum distanc...
research
04/27/2022

On subspace designs

The aim of this paper is to investigate the theory of subspace designs, ...
research
07/09/2020

Scattered subspaces and related codes

After a seminal paper by Shekeey (2016), a connection between maximum h-...
research
03/13/2023

Geometric dual and sum-rank minimal codes

The main purpose of this paper is to further study the structure, parame...
research
01/16/2019

Set-Codes with Small Intersections and Small Discrepancies

We are concerned with the problem of designing large families of subsets...

Please sign up or login with your details

Forgot password? Click here to reset