Progress on high-rate MSR codes: Enabling arbitrary number of helper nodes

Ankit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

Abstract

This paper presents a construction for high-rate MDS codes that enable bandwidth-efficient repair of a single node. Such MDS codes are also referred to as the minimum storage regenerating (MSR) codes in the distributed storage literature. The construction presented in this paper generates MSR codes for all possible number of helper nodes d as d is a design parameter in the construction. Furthermore, the obtained MSR codes have polynomial sub-packetization (a.k.a. node size) α. The construction is built on the recent code proposed by Sasidharan et al. [1], which works only for d = n - 1, i.e., where all the remaining nodes serve as the helper nodes for the bandwidth-efficient repair of a single node. The results of this paper broaden the set of parameters where the constructions of MSR codes were known earlier.

Original languageEnglish (US)
Title of host publication2016 Information Theory and Applications Workshop, ITA 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509025299
DOIs
StatePublished - Mar 27 2017
Event2016 Information Theory and Applications Workshop, ITA 2016 - La Jolla, United States
Duration: Jan 31 2016Feb 5 2016

Other

Other2016 Information Theory and Applications Workshop, ITA 2016
CountryUnited States
CityLa Jolla
Period1/31/162/5/16

Keywords

  • Codes for distributed storage
  • minimum storage regenerating (MSR) codes
  • regenerating codes
  • sub-packetization

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Artificial Intelligence
  • Information Systems
  • Signal Processing

Fingerprint Dive into the research topics of 'Progress on high-rate MSR codes: Enabling arbitrary number of helper nodes'. Together they form a unique fingerprint.

Cite this