Language
We detect your regional language is French. Do you want to change site's language to French? You may choose other languages.International
English
中文
русск
français
español
العربية
User Center
My Training Class
Feedback
IEEE Transactions on Information Theory | Vol.62, Issue.6 | | Pages 3053-3069
BASIC Codes: Low-Complexity Regenerating Codes for Distributed Storage Systems
In distributed storage systems, regenerating codes can achieve the optimal tradeoff between storage capacity and repair bandwidth. However, a critical drawback of existing regenerating codes, in general, is the high coding and repair complexity, since the coding and repair processes involve expensive multiplication operations in finite field. In this paper, we present a design framework of regenerating codes, which employ binary addition and bitwise cyclic shift as the elemental operations, named BASIC regenerating codes. The proposed BASIC regenerating codes can be regarded as a concatenated code with the outer code being a binary parity-check code, and the inner code being a regenerating code utilizing the binary parity-check code as the alphabet. We show that the proposed functional-repair BASIC regenerating codes can achieve the fundamental tradeoff curve between the storage and repair bandwidth asymptotically of functional-repair regenerating codes with less computational complexity. Furthermore, we demonstrate that the existing exact-repair product-matrix construction of regenerating codes can be modified to exact-repair BASIC product-matrix regenerating codes with much less encoding, repair, and decoding complexity from the theoretical analysis, and with less encoding time, repair time, and decoding time from the implementation results.
Original Text (This is the original text for your reference.)
BASIC Codes: Low-Complexity Regenerating Codes for Distributed Storage Systems
In distributed storage systems, regenerating codes can achieve the optimal tradeoff between storage capacity and repair bandwidth. However, a critical drawback of existing regenerating codes, in general, is the high coding and repair complexity, since the coding and repair processes involve expensive multiplication operations in finite field. In this paper, we present a design framework of regenerating codes, which employ binary addition and bitwise cyclic shift as the elemental operations, named BASIC regenerating codes. The proposed BASIC regenerating codes can be regarded as a concatenated code with the outer code being a binary parity-check code, and the inner code being a regenerating code utilizing the binary parity-check code as the alphabet. We show that the proposed functional-repair BASIC regenerating codes can achieve the fundamental tradeoff curve between the storage and repair bandwidth asymptotically of functional-repair regenerating codes with less computational complexity. Furthermore, we demonstrate that the existing exact-repair product-matrix construction of regenerating codes can be modified to exact-repair BASIC product-matrix regenerating codes with much less encoding, repair, and decoding complexity from the theoretical analysis, and with less encoding time, repair time, and decoding time from the implementation results.
+More
bitwise cyclic shift tradeoff between storage capacity storage and repair bandwidth asymptotically multiplication operations exactrepair productmatrix construction of regenerating codes distributed storage systems regenerating codes binary paritycheck code general finite encoding time repair time computational complexity
Translate engine
Article's language
Action
Report
Share
Recommended articles
Report
Select your report category*
Reason*
Your level privilege is in sufficient. You can go to the “User Center” to view your level information and perform points tasks to upgrade your level.
New sign-in location：
Last sign-in location：
Last sign-in date：
About to jump to an external site.
Security unknown, whether to continue