# Practical Functional Regenerating Codes for Broadcast Repair of Multiple Nodes

## TL;DR

This paper introduces a practical coding scheme for efficient repair of multiple node failures in wireless distributed storage, optimizing bandwidth and storage with low complexity.

## Contribution

It presents a new code construction for functional regeneration using linearized polynomials, achieving optimal points with low subpacketization and computational cost.

## Key findings

- Achieves minimum-bandwidth regenerating point.
- Supports repair of multiple node failures efficiently.
- Provides insights into the properties of functional regenerating codes.

## Abstract

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.