Linear MSRD codes with Various Matrix Sizes and Unrestricted Lengths

06/06/2022

∙

by   Hao Chen, et al.

∙

0

∙

share

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.