Linear Cutting Blocking Sets and Minimal Codes in the Rank Metric

06/23/2021
by   Gianira N. Alfarano, et al.
0

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 Hamming-metric code to a rank-metric one, in such a way that various rank-metric properties naturally translate into the homonymous Hamming-metric notions under this correspondence. The most interesting applications of our results lie in the theory of minimal rank-metric codes, which we introduce and study from several angles. Our main contributions are bounds for the parameters of a minimal rank-metric codes, a general existence result based on a combinatorial argument, and an explicit code construction for some parameter sets that uses the notion of a scattered linear set. Throughout the paper we also show and comment on curious analogies/divergences between the theories of error-correcting codes in the rank and in the Hamming metric.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2022

New MRD codes from linear cutting blocking sets

Minimal rank-metric codes or, equivalently, linear cutting blocking sets...
research
04/27/2022

On subspace designs

The aim of this paper is to investigate the theory of subspace designs, ...
research
06/29/2023

Saturating linear sets of minimal rank

Saturating sets are combinatorial objects in projective spaces over fini...
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
05/26/2020

Stolarsky's invariance principle for finite metric spaces

Stolarsky's invariance principle quantifies the deviation of a subset of...
research
08/22/2022

Densities of Codes of Various Linearity Degrees in Translation-Invariant Metric Spaces

We investigate the asymptotic density of error-correcting codes with goo...
research
01/04/2018

Asymptotic bounds for spherical codes

The set of all error-correcting codes C over a fixed finite alphabet F o...

Please sign up or login with your details

Forgot password? Click here to reset