  We construct maximally recoverable codes (corresponding to partial MDS codes)
which are based on linearized Reed-Solomon codes. The new codes have a smaller
field size requirement compared with known constructions. For certain
asymptotic regimes, the constructed codes have order-optimal alphabet size,
asymptotically matching the known lower bound.
