# Determinant Codes with Helper-Independent Repair for Single and Multiple Failures

## TL;DR

This paper introduces a new helper-independent repair mechanism for determinant codes in distributed storage, enabling efficient repair of single and multiple failures while maintaining the code's properties.

## Contribution

It proposes a helper-independent repair method for determinant codes and demonstrates their capability to repair multiple failures with sub-linear repair bandwidth.

## Key findings

- Helper-independent repair mechanism achieved for determinant codes.
- Determinant codes can repair multiple failures with sub-linear bandwidth.
- Preserves all original properties of determinant codes.

## Abstract

Determinant codes are a class of exact-repair regenerating codes for distributed storage systems with parameters (n, k = d, d). These codes cover the entire trade-off between per-node storage and repair-bandwidth. In an earlier work of the authors, the repair data of the determinant code sent by a helper node to repair a failed node depends on the identity of the other helper nodes participating in the process, which is practically undesired. In this work, a new repair mechanism is proposed for determinant codes, which relaxes this dependency, while preserving all other properties of the code. Moreover, it is shown that the determinant codes are capable of repairing multiple failures, with a per-node repair-bandwidth which scales sub-linearly with the number of failures.