Improved layered regenerating codes characterizing the exact-repair storage-repair bandwidth tradeoff for certain parameter sets

Kaushik Senthoor, Birenjith Sasidharan, P. Vijay Kumar

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

14 Citations (Scopus)


The characterization of the storage-repair bandwidth tradeoff of (n, k, d)-regenerating codes under the exact-repair setting remains an open problem. The problem has been solved only for the special case of (n, k, d) = (4, 3, 3). In the present paper, we characterize the tradeoff for the larger family of parameters (n, k = 3, d = n - 1). This is accomplished by constructing an (n, k < d, d)-regenerating code, referred to as the improved layered code. In the case when (n, k = 3, d = n - 1), the code operates on a point that coincides with an interior point of a recently derived outer bound on the tradeoff. The code also achieves an interior point on the outer bound for the parameter set (n, k = 4, d = n - 1).

Original languageEnglish
Title of host publication2015 IEEE Information Theory Workshop, ITW 2015
PublisherIEEE, Institute of Electrical and Electronics Engineers
ISBN (Electronic)9781479955268
Publication statusPublished - 24 Jun 2015
Externally publishedYes
EventInformation Theory Workshop 2015 (Spring) - Jerusalem, Israel
Duration: 26 Apr 20151 May 2015 (Proceedings)


WorkshopInformation Theory Workshop 2015 (Spring)
Abbreviated titleITW 2015
Internet address

Cite this