Shortened Regenerating Codes

DOI10.1109/TIT.2018.2840995zbMATH Open1427.94110arXiv1505.00178OpenAlexW2963538770WikidataQ129751465 ScholiaQ129751465MaRDI QIDQ4615359FDOQ4615359

Authors: Iwan Duursma 

Publication date: 28 January 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: For general exact repair regenerating codes, the optimal trade-offs between storage size and repair bandwith remain undetermined. Various outer bounds and partial results have been proposed. Using a simple chain rule argument we identify nonnegative differences between the functional repair and the exact repair outer bounds. One of the differences is then bounded from below by the repair data of a shortened subcode. Our main result is a new outer bound for an exact repair regenerating code in terms of its shortened subcodes. In general the new outer bound is implicit and depends on the choice of shortened subcodes. For the linear case we obtain explicit bounds.

Full work available at URL: https://arxiv.org/abs/1505.00178

Mathematics Subject Classification ID

Other types of codes (94B60)

Cited In (4)

• Codes for Distributed Storage
• Making the Long Code Shorter
• Multilinear Algebra for Distributed Storage
• Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction

This page was built for publication: Shortened Regenerating Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615359)