Abstract
Two-parity maximum distance separable (MDS) array codes achieve the lowest storage overhead for tolerating two erasures. In this letter, we propose two new classes of two-parity MDS array codes over finite field $\mathbb {F}_{2}$ , with which each single node failure can be recovered by reading the minimum amount of data from each surviving node.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
