Scalable (n, k, d) exact-repair regenerating codes with small repair bandwidth

Mehran Elyasi, Soheil Mohajer

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

3 Scopus citations

Abstract

This paper focuses on the design of regeneration codes. An (n, k, d) exact-regenerating code encodes and stores the data into n nodes such that the entire data can be recovered from any k nodes, and the missing coded information of any failed node can be identically recovered by the help of d nodes. In an earlier work of the authors, determinant codes are introduced for any (n, k, d = k) system, and they are shown to achieve the optimum tradeoff between the node storage α and the repair-bandwidth β In this work, the latter constraint of d = k is relaxed, and the construction of determinant codes is generalized to arbitrary parameters (n, k, d), for a certain range of (α,β). The proposed construction is scalable, in the sense that the system performance only depend on k and d, and the same of operating point (α,β) can be universally achieved for any number of nodes n. The resulting codes are linear, and the required size of the underlying finite field is not greater than Θ(n).

Original languageEnglish (US)
Title of host publication2017 IEEE International Conference on Communications, ICC 2017
EditorsMerouane Debbah, David Gesbert, Abdelhamid Mellouk
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781467389990
DOIs
StatePublished - Jul 28 2017
Event2017 IEEE International Conference on Communications, ICC 2017 - Paris, France
Duration: May 21 2017May 25 2017

Publication series

NameIEEE International Conference on Communications
ISSN (Print)1550-3607

Other

Other2017 IEEE International Conference on Communications, ICC 2017
CountryFrance
CityParis
Period5/21/175/25/17

Fingerprint Dive into the research topics of 'Scalable (n, k, d) exact-repair regenerating codes with small repair bandwidth'. Together they form a unique fingerprint.

Cite this