pith. sign in

arxiv: 1605.00020 · v2 · pith:NQ4BOL3Ynew · submitted 2016-04-29 · 💻 cs.IT · math.IT

Locally Repairable Regenerating Code Constructions

classification 💻 cs.IT math.IT
keywords codeconstructionslocallyregeneratingrepairableanalysisfamilyfile
0
0 comments X
read the original abstract

In this work, we give locally repairable regenerating code (LRRC) [1]-[3], [5], [6] constructions that can protect the file size promised by the graph analysis of the modified family helper selection (MFHS) scheme [1] at the minimum-bandwidth-regenerating (MBR) point.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.