Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
Partial MDS (PMDS) codes are a class of erasure-correcting array codes that combine local correction of the rows with global correction of the array. An m× n array code is called an (rs) PMDS code if each row belongs to an [n, n-r, r+1] MDS code and the code can correct erasure patterns consisting of r erasures in each row together with s more erasures anywhere in the array. While a recent construction by Calis and Koyluoglu generates (r; s) PMDS codes for all r and s, its field size is exponentially large. In this paper, a family of PMDS codes with field size O\left (max m, nr+ss}\right) is presented for the case where r= O(1), s= O(1).
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006