@inproceedings{huang2007on,
author = {Huang, Cheng and Li, Jin and Chen, Minghua},
title = {On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications},
booktitle = {Information Theory Workshop, 2007. ITW '07. IEEE},
year = {2007},
month = {September},
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 XORbased 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.},
publisher = {Institute of Electrical and Electronics Engineers},
url = {http://approjects.co.za/?big=en-us/research/publication/optimizing-xor-based-codes-fault-tolerant-storage-applications/},
pages = {218-223},
isbn = {1-4244-1563-2},
edition = {Information Theory Workshop, 2007. ITW '07. IEEE},
}