Journal article
A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
Abstract
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.
Authors
Cai H; Miao Y; Schwartz M; Tang X
Journal
IEEE Transactions on Information Theory, Vol. 68, No. 1, pp. 204–212
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
January 1, 2022
DOI
10.1109/tit.2021.3120016
ISSN
0018-9448