TY - GEN
T1 - Explicit MBR all-symbol locality codes
AU - Kamath, Govinda M.
AU - Silberstein, Natalia
AU - Prakash, N.
AU - Rawat, Ankit S.
AU - Lalitha, V.
AU - Koyluoglu, O. Ozan
AU - Kumar, P. Vijay
AU - Vishwanath, Sriram
PY - 2013
Y1 - 2013
N2 - Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes with locality, which minimize the number of nodes participating in the repair process. This paper focuses on regenerating codes with locality, using pre-coding based on Gabidulin codes, and presents constructions that utilize minimum bandwidth regenerating (MBR) local codes. The constructions achieve maximum resilience (i.e., optimal minimum distance) and have maximum capacity (i.e., maximum rate). Finally, the same pre-coding mechanism can be combined with a subclass of fractional-repetition codes to enable maximum resilience and repair-by-transfer simultaneously.
AB - Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes with locality, which minimize the number of nodes participating in the repair process. This paper focuses on regenerating codes with locality, using pre-coding based on Gabidulin codes, and presents constructions that utilize minimum bandwidth regenerating (MBR) local codes. The constructions achieve maximum resilience (i.e., optimal minimum distance) and have maximum capacity (i.e., maximum rate). Finally, the same pre-coding mechanism can be combined with a subclass of fractional-repetition codes to enable maximum resilience and repair-by-transfer simultaneously.
UR - http://www.scopus.com/inward/record.url?scp=84890390505&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84890390505&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2013.6620277
DO - 10.1109/ISIT.2013.6620277
M3 - Conference contribution
AN - SCOPUS:84890390505
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 504
EP - 508
BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -