High-Rate MSR Code With Polynomial Sub-Packetization Level

Sasidharan, Birenjith and Agarwal, Gaurav Kumar and Kumar, Vijay P (2015) High-Rate MSR Code With Polynomial Sub-Packetization Level. In: IEEE International Symposium on Information Theory (ISIT), JUN 14-19, 2015, Hong Kong, PEOPLES R CHINA, pp. 2051-2055.

PDF IEEE_Int_Sym_Inf_The_2051_2015.pdf - Published Version Restricted to Registered users only Download (249kB) | Request a copy

Abstract

We present a high-rate (n, k, d = n - 1)-MSR code with a sub-packetization level that is polynomial in the dimension k of the code. While polynomial sub-packetization level was achieved earlier for vector MDS codes that repair systematic nodes optimally, no such MSR code construction is known. In the low-rate regime (i. e., rates less than one-half), MSR code constructions with a linear sub-packetization level are available. But in the high-rate regime (i. e., rates greater than one-half), the known MSR code constructions required a sub-packetization level that is exponential in k. In the present paper, we construct an MSR code for d = n - 1 with a fixed rate R = t-1/t, t >= 2, achieveing a sub-packetization level alpha = O(k(t)). The code allows help-by-transfer repair, i. e., no computations are needed at the helper nodes during repair of a failed node.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Additional Information:	IEEE International Symposium on Information Theory (ISIT), Hong Kong, PEOPLES R CHINA, JUN 14-19, 2015
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	07 Dec 2016 05:46
Last Modified:	07 Dec 2016 05:46
URI:	http://eprints.iisc.ac.in/id/eprint/55513

Actions (login required)

View Item