Constructions of Partial MDS Codes Over Small Fields
From MaRDI portal
Publication:5224025
DOI10.1109/TIT.2018.2890201zbMath1432.94168MaRDI QIDQ5224025
Mario Blaum, Ryan Gabrys, Eitan Yaakobi, Paul H. Siegel
Publication date: 19 July 2019
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (8)
A construction of maximally recoverable codes ⋮ Linear programming bounds for distributed storage codes ⋮ A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices ⋮ Some optimal cyclic \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t}\)-codes ⋮ Rank-Metric Codes and Their Applications ⋮ Codes for Distributed Storage ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications ⋮ Constructing Partial MDS Codes from Reducible Algebraic Curves
This page was built for publication: Constructions of Partial MDS Codes Over Small Fields
