EVENODD code[1]
Description
A binary array code that can correct any two disk failures (i.e., two erasures). See [2] for more details.
Decoding
Efficient decoding algorithm against two erasures [1].
Parents
- Generalized EVENODD code — Generalized EVENODD codes reduce to EVENODD codes for \(r=2\) [2].
- MDS array code — EVENODD codes are examples of MDS array codes [3].
References
- [1]
- M. Blaum, J. Brady, J. Bruck, and Jai Menon, “EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures”, IEEE Transactions on Computers 44, 192 (1995) DOI
- [2]
- M. Blaum, P. G. Farrell, H. C. A. van Tilborg, 1998. Array codes. Handbook of coding theory, 2 (Part 2), pp. 1855-1909.
- [3]
- I. Tamo, Z. Wang, and J. Bruck, “Zigzag Codes: MDS Array Codes With Optimal Rebuilding”, IEEE Transactions on Information Theory 59, 1597 (2013) arXiv:1112.0371 DOI
Page edit log
- Victor V. Albert (2024-08-19) — most recent
Cite as:
“EVENODD code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/evenodd