DocumentCode :
3502456
Title :
Distributed storage codes through Hadamard designs
Author :
Papailiopoulos, Dimitris S. ; Dimakis, Alexandros G.
Author_Institution :
Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA
fYear :
2011
fDate :
July 31 2011-Aug. 5 2011
Firstpage :
1230
Lastpage :
1234
Abstract :
In distributed storage systems that employ erasure coding, the issue of minimizing the total repair bandwidth required to exactly regenerate a storage node after a failure arises. This repair bandwidth depends on the structure of the storage code and the repair strategies used to restore the lost data. Minimizing it requires that undesired data during a repair align in the smallest possible spaces, using the concept of interference alignment (IA). Here, a points-on-a-lattice representation of the symbol extension IA of Cadambe et al. provides cues to perfect IA instances which we combine with fundamental properties of Hadamard matrices to construct a new storage code with favorable repair properties. Specifically, we build an explicit (k+2, k) storage code over GF(3), whose single systematic node failures can be repaired with bandwidth that matches exactly the theoretical minimum. Moreover, the repair of single parity node failures generates at most the same repair bandwidth as any systematic node failure. Our code can tolerate any single node failure and any pair of failures that involves at most one systematic failure.
Keywords :
Hadamard codes; Hadamard matrices; Hadamard designs; Hadamard matrices; distributed storage codes; erasure coding; interference alignment; point-on-a-lattice representation; single parity node failures; single systematic node failures; storage node regeneration; Bandwidth; Encoding; Equations; Interference; Maintenance engineering; Peer to peer computing; Systematics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
ISSN :
2157-8095
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
Type :
conf
DOI :
10.1109/ISIT.2011.6033731
Filename :
6033731
Link To Document :
بازگشت