Proceedings of 2012 2nd International Conference on Computer Science and Network Technology 2012
DOI: 10.1109/iccsnt.2012.6526358
|View full text |Cite
|
Sign up to set email alerts
|

Improved decoding algorithm for the generalized EVENODD array code

Abstract: data placement scheme based on the generalized EVENODD array code was one of the most important choices for data storage systems to tolerate failures. The efficiency of the erasure code was directly related to the number of XOR operations during the encoding and decoding. We provided an improved decoding algorithm of the generalized EVENODD array code for correcting various triple node failures. It showed that the decoding complexity of the new algorithm was much lower than those of the existing comparable alg… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…Storage industry, academic projects as well as major technology corporations routinely employ erasure coding [9]. Furthermore, to attain higher fault tolerance, designs like EVENODD (p, 3) [11] and EVENODD (p, 4) [10] have been introduced. In contrast, RS code finds broader application across various scenarios and industries, whereas EVENODD code is primarily confined to its common usage within storage systems.…”
Section: Applicationmentioning
confidence: 99%
“…Storage industry, academic projects as well as major technology corporations routinely employ erasure coding [9]. Furthermore, to attain higher fault tolerance, designs like EVENODD (p, 3) [11] and EVENODD (p, 4) [10] have been introduced. In contrast, RS code finds broader application across various scenarios and industries, whereas EVENODD code is primarily confined to its common usage within storage systems.…”
Section: Applicationmentioning
confidence: 99%
“…Summing them up, the implementation of encoding would need 3x XOR operations. So, implementing on the bytes b0, b1, •••, b(m-1) requires such times of XORs [11].…”
Section: Tradeoffs and Complexity Computation In Encoding Of Rs And E...mentioning
confidence: 99%