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

08/07/2018
by   Umberto Martínez-Peñas, et al.
0

The sum-rank metric naturally extends both the Hamming and rank metrics in coding theory over fields. It measures the error-correcting capability of codes in multishot matrix-multiplicative channels (e.g. linear network coding or the discrete memoryless channel on fields). Although this metric has already shown to be of interest in several applications, not much is known about it. In this work, sum-rank supports for codewords and linear codes are introduced and studied, with emphasis on duality. The lattice structure of sum-rank supports is given; characterizations of the ambient spaces (support spaces) they define are obtained; and the classical operations of restriction and shortening are extended to the sum-rank metric, together with estimations on the code parameters they provide. Three main applications are given: 1) Generalized sum-rank weights are introduced, together with their basic properties and bounds; 2) It is shown that duals, shortened and restricted codes of maximum sum-rank distance (MSRD) codes are in turn MSRD; 3) Degenerateness and effective lengths of sum-rank codes are introduced and characterized.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset