Paper Info
Title
BASIC regenerating code: Binary addition and shift for exact repair
Abstract
Regenerating code is a class of storage codes that achieve the optimal trade-off between storage capacity and repair bandwidth, which are two important performance metrics in data storage systems. However, existing constructions of regenerating codes rely on expensive computational operations such as finite field multiplication. The high coding and repair complexity limit their applications in large-scale practical storage systems. In this paper, we show that it is possible to achieve the full potential of regenerating codes with low computational complexity. In particular, we propose a new class of regenerating codes, called BASIC codes, that can achieve two specific points (i.e., minimum-bandwidth and minimum-storage regenerating points) on the storage and repair bandwidth trade-off curve, using only binary addition and shift operations in the coding and repair processes. Although in this paper we focus on constructing and analyzing BASIC codes for two specific exact-repair settings, our framework can be generalized to develop BASIC codes for more general exact- and functional-repair regenerating codes. © 2013 IEEE.
Year
DOI
Venue
2013
10.1109/ISIT.2013.6620501
IEEE International Symposium on Information Theory - Proceedings
Keywords
Field
DocType
Distributed storage system, regenerating codes, convolutional codes
Online codes,Concatenated error correction code,Combinatorics,Luby transform code,Fountain code,Computer science,Turbo code,Block code,Reed–Muller code,Linear code
Conference
Citations 
PageRank 
References 
11
0.55
13
Authors
4
Name
Order
Citations
PageRank
Hou Hanxu18314.46
Kenneth W. Shum2877.09
Minghua Chen3104968.89
Li Hui417334.14