Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix
Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix
Linearized Reed-Solomon (LRS) codes are a class of evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric, and therefore are known as maximum sum-rank distance (MSRD) codes. In this work, we give necessary and sufficient conditions on the existence of MSRD codes with support-constrained …