Fundamental Properties of Sum-Rank Metric Codes

10/06/2020
by   Eimear Byrne, et al.
0

This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory of sum-rank metric codes is also explored, showing that MSRD codes (the sum-rank analogue of MDS codes) dualize to MSRD codes only if all matrix blocks have the same number of columns. In the latter case, duality considerations lead to an upper bound on the number of blocks for MSRD codes. The paper also contains various constructions of sum-rank metric codes for variable block sizes, illustrating the possible behaviours of these objects with respect to bounds, existence, and duality properties.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/05/2022

Covering Properties of Sum-Rank Metric Codes

The sum-rank metric can be seen as a generalization of both, the rank an...
research
03/14/2022

Multilayer crisscross error and erasure correction

In this work, multilayer crisscross error and erasures are considered, w...
research
05/26/2022

New Explicit Good Linear Sum-Rank-Metric Codes

Sum-rank-metric codes have wide applications in universal error correcti...
research
06/06/2022

Linear MSRD codes with Various Matrix Sizes and Unrestricted Lengths

A sum-rank-metric code attaining the Singleton bound is called maximum s...
research
08/07/2018

Theory of supports for linear codes endowed with the sum-rank metric

The sum-rank metric naturally extends both the Hamming and rank metrics ...
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
11/05/2020

Common Complements of Linear Subspaces and the Sparseness of MRD Codes

We consider the problem of estimating the number of common complements o...

Please sign up or login with your details

Forgot password? Click here to reset