Sparse and Balanced MDS Codes Over Small Fields

DOI10.1109/TIT.2022.3162524MaRDI QIDQ5096974zbMATH OpenOpenAlexFDO

Authors Tingting Chen, Xian De Zhang

Publication date 19 August 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2011.05634

zbMATH Keywords

Maximum Distance Separable (MDS) codessmall fieldssparse and balanced generator matrix

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: Maximum Distance Separable (MDS) codes with a sparse and balanced generator matrix are appealing in distributed storage systems for balancing and minimizing the computational load. Such codes have been constructed via Reed-Solomon codes over large fields. In this paper, we focus on small fields. We prove that there exists an $[n,k{]}_q$ MDS code that has a sparse and balanced generator matrix for any $qgeqn$ provided that $nleq2k$, by designing several algorithms with complexity running in polynomial time in $k$ and $n$.

Cited in

(4)

• Near-MDS codes over some small fields
• Sparse and Balanced Reed–Solomon and Tamo–Barg Codes
• Constructions of Partial MDS Codes Over Small Fields
• On additive MDS codes over small fields

This page was built for publication: Sparse and Balanced MDS Codes Over Small Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096974)