New MRD codes from linear cutting blocking sets

Abstract

Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated $q$-system. Using this result, we provide the first construction of a family of ${\mathbb{F}}_{q^m}$-linear MRD codes of length $2m$ that are not obtained as a direct sum of two smaller MRD codes. In addition, such a family has better parameters, since its codes possess generalized rank weights strictly larger than those of the previously known MRD codes. This shows that not all the MRD codes have the same generalized rank weights, in contrast to what happens in the Hamming metric setting.

31 pages; published in Annali di Matematica Pura ed Applicata

References in corpus (7)

• A Rank-Metric Approach to Error Control in Random Network Coding
• Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
• Linear-algebraic list decoding of folded Reed-Solomon codes
• Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
• On defining generalized rank weights
• Relative generalized matrix weights of matrix codes for universal security on wire-tap networks
• New Parameters of Linear Codes Expressing Security Performance of Universal Secure Network Coding