On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications

Cheng Huang; Jin Li; Minghua Chen

doi:10.1109/ITW.2007.4313077

On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications

Cheng Huang, Jin Li, Minghua Chen

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

35 Citations (Scopus)

Abstract

For fault-tolerant storage applications, computation complexity is the key concern in choosing XOR-based codes. We observe that there is great benefit in computing common operations first (COF). Based on the COF rule, we describe a generic problem of optimizing XOR-based codes and make a conjecture about its NP-completeness. Two effective greedy algorithms are proposed. Against long odds, we show that XOR-based Reed-Solomon codes with such optimization can in fact be as efficient and sometimes even more efficient than the best known specifically designed XOR-based codes. © 2007 IEEE.

Original language	English
Title of host publication	2007 IEEE Information Theory Workshop (ITW 2007) - Proceedings
Publisher	IEEE
Pages	218-223
ISBN (Print)	1-4244-1563-2
DOIs	https://doi.org/10.1109/ITW.2007.4313077
Publication status	Published - Sept 2007
Externally published	Yes
Event	2007 IEEE Information Theory Workshop, ITW 2007 - Lake Tahoe, CA, United States Duration: 2 Sept 2007 → 6 Sept 2007

Publication series

Name	IEEE Information Theory Workshop, ITW, Proceedings

Conference

Conference	2007 IEEE Information Theory Workshop, ITW 2007
Country/Territory	United States
City	Lake Tahoe, CA
Period	2/09/07 → 6/09/07

Access Output

10.1109/ITW.2007.4313077

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{9ba513153f3c48d481963b9e0e9eae96,

title = "On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications",

abstract = "For fault-tolerant storage applications, computation complexity is the key concern in choosing XOR-based codes. We observe that there is great benefit in computing common operations first (COF). Based on the COF rule, we describe a generic problem of optimizing XOR-based codes and make a conjecture about its NP-completeness. Two effective greedy algorithms are proposed. Against long odds, we show that XOR-based Reed-Solomon codes with such optimization can in fact be as efficient and sometimes even more efficient than the best known specifically designed XOR-based codes. {\textcopyright} 2007 IEEE.",

author = "Cheng Huang and Jin Li and Minghua Chen",

year = "2007",

month = sep,

doi = "10.1109/ITW.2007.4313077",

language = "English",

isbn = "1-4244-1563-2",

series = "IEEE Information Theory Workshop, ITW, Proceedings",

publisher = "IEEE",

pages = "218--223",

booktitle = "2007 IEEE Information Theory Workshop (ITW 2007) - Proceedings",

address = "United States",

note = "2007 IEEE Information Theory Workshop, ITW 2007 ; Conference date: 02-09-2007 Through 06-09-2007",

}

Huang, C, Li, J & Chen, M 2007, On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications. in 2007 IEEE Information Theory Workshop (ITW 2007) - Proceedings., 4313077, IEEE Information Theory Workshop, ITW, Proceedings, IEEE, pp. 218-223, 2007 IEEE Information Theory Workshop, ITW 2007, Lake Tahoe, CA, United States, 2/09/07. https://doi.org/10.1109/ITW.2007.4313077

On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications. / Huang, Cheng; Li, Jin; Chen, Minghua.
2007 IEEE Information Theory Workshop (ITW 2007) - Proceedings. IEEE, 2007. p. 218-223 4313077 (IEEE Information Theory Workshop, ITW, Proceedings).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications

AU - Huang, Cheng

AU - Li, Jin

AU - Chen, Minghua

PY - 2007/9

Y1 - 2007/9

N2 - For fault-tolerant storage applications, computation complexity is the key concern in choosing XOR-based codes. We observe that there is great benefit in computing common operations first (COF). Based on the COF rule, we describe a generic problem of optimizing XOR-based codes and make a conjecture about its NP-completeness. Two effective greedy algorithms are proposed. Against long odds, we show that XOR-based Reed-Solomon codes with such optimization can in fact be as efficient and sometimes even more efficient than the best known specifically designed XOR-based codes. © 2007 IEEE.

AB - For fault-tolerant storage applications, computation complexity is the key concern in choosing XOR-based codes. We observe that there is great benefit in computing common operations first (COF). Based on the COF rule, we describe a generic problem of optimizing XOR-based codes and make a conjecture about its NP-completeness. Two effective greedy algorithms are proposed. Against long odds, we show that XOR-based Reed-Solomon codes with such optimization can in fact be as efficient and sometimes even more efficient than the best known specifically designed XOR-based codes. © 2007 IEEE.

UR - http://www.scopus.com/inward/record.url?scp=46749112305&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-46749112305&origin=recordpage

U2 - 10.1109/ITW.2007.4313077

DO - 10.1109/ITW.2007.4313077

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 1-4244-1563-2

T3 - IEEE Information Theory Workshop, ITW, Proceedings

SP - 218

EP - 223

BT - 2007 IEEE Information Theory Workshop (ITW 2007) - Proceedings

PB - IEEE

T2 - 2007 IEEE Information Theory Workshop, ITW 2007

Y2 - 2 September 2007 through 6 September 2007

ER -

On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications

Abstract

Publication series

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this