Linear MSRD codes with Various Matrix Sizes and Unrestricted Lengths

06/06/2022
by   Hao Chen, et al.
0

A sum-rank-metric code attaining the Singleton bound is called maximum sum-rank distance (MSRD). MSRD codes have been constructed for some parameter cases. In this paper we construct a linear MSRD code over an arbitrary field F_q with various matrix sizes n_1>n_2>⋯>n_t satisfying n_i ≥ n_i+1^2+⋯+n_t^2 for i=1, 2, …, t-1 for any given minimum sum-rank distance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/26/2022

New Explicit Good Linear Sum-Rank-Metric Codes

Sum-rank-metric codes have wide applications in universal error correcti...
research
08/08/2019

Hamming and simplex codes for the sum-rank metric

Sum-rank Hamming codes are introduced in this work. They are essentially...
research
06/24/2020

The variation of the sum of edge lengths in linear arrangements of trees

A fundamental problem in network science is the normalization of the top...
research
04/16/2023

Sidon sets, sum-free sets and linear codes

Finding the maximum size of a Sidon set in 𝔽_2^t is of research interest...
research
10/06/2020

Fundamental Properties of Sum-Rank Metric Codes

This paper investigates the theory of sum-rank metric codes for which th...
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
06/04/2018

On the computational complexity of blind detection of binary linear codes

In this work, we study the computational complexity of the Minimum Dista...

Please sign up or login with your details

Forgot password? Click here to reset