We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

cs.IT

Change to browse by:

References & Citations

DBLP - CS Bibliography

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Computer Science > Information Theory

Title: New EVENODD+ Codes with More Flexible Parameters and Lower Complexity

Authors: Panyu Zhu
Abstract: EVENODD+ codes are binary maximum distance separable (MDS) array codes for correcting double disk failures in RAID-6 with asymptotically optimal encoding/decoding/update complexities. However, the number of bits stored in each disk of EVENODD+ codes should be an odd number minus one. In this paper, we present a new construction of EVENODD+ codes that have more flexible parameters. The number of bits stored in each disk of our codes is an odd minus one times any positive integer. Moreover, our codes not only have asymptotically optimal encoding/decoding/update complexities but also have lower encoding/decoding/update complexities than the existing EVENODD+ codes.
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2404.19578 [cs.IT]
  (or arXiv:2404.19578v1 [cs.IT] for this version)

Submission history

From: Panyu Zhu [view email]
[v1] Tue, 30 Apr 2024 14:15:16 GMT (17kb)

Link back to: arXiv, form interface, contact.