Practical Functional Regenerating Codes for Broadcast Repair of Multiple Nodes
Journal article, Peer reviewed
Accepted version
Åpne
Permanent lenke
http://hdl.handle.net/11250/2630639Utgivelsesdato
2019Metadata
Vis full innførselSamlinger
Originalversjon
IEEE International Symposium on Information Theory. Proceedings. 2019, 2019-July 221-225. 10.1109/ISIT.2019.8849496Sammendrag
A code construction and repair scheme for optimal functional regeneration of multiple node failures is presented, which is based on stitching together short MDS codes on carefully chosen sets of points lying on a linearized polynomial. The nodes are connected wirelessly, hence all transmissions by helper nodes during a repair round are available to all the nodes being repaired. The scheme is simple and practical because of low subpacketization, low I/O cost and low computational cost. Achievability of the minimum-bandwidth regenerating (MBR) point, as well as an interior point, on the optimal storage-repair bandwidth tradeoff curve is shown. The subspace properties derived in the paper provide insight into the general properties of functional regenerating codes.