Product matrix minimum storage regenerating codes with flexible number of helpers

Kaveh Mahdaviani, Soheil Mohajer, Ashish Khisti

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

2 Scopus citations


In coding for distributed storage systems, efficient data reconstruction and repair through accessing a predefined number of arbitrarily chosen storage nodes is guaranteed by regenerating codes. Traditionally, code parameters, specially the number of helper nodes participating in a repair process, are predetermined. However, depending on the state of the system and network traffic, it is desirable to adapt such parameters accordingly in order to minimize the cost of repair. In this work a class of regenerating codes with minimum storage is introduced that can simultaneously operate at the optimal repair bandwidth, for a wide range of exact repair mechanisms, based on different number of helper nodes.

Original languageEnglish (US)
Title of host publication2017 IEEE Information Theory Workshop, ITW 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages5
ISBN (Electronic)9781509030972
StatePublished - Jan 31 2018
Event2017 IEEE Information Theory Workshop, ITW 2017 - Kaohsiung, Taiwan, Province of China
Duration: Nov 6 2017Nov 10 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095


Other2017 IEEE Information Theory Workshop, ITW 2017
Country/TerritoryTaiwan, Province of China

Bibliographical note

Funding Information:
The work of S. Mohajer is supported by the National Science Foundation under Grant CCF-1617884.

Publisher Copyright:
© 2017 IEEE.


Dive into the research topics of 'Product matrix minimum storage regenerating codes with flexible number of helpers'. Together they form a unique fingerprint.

Cite this