Hypergraph-Based Binary Locally Repairable Codes With Availability

We study a hypergraph-based code construction for binary locally repairable codes (LRCs) with availability. A symbol of a code is said to have $(r, t)$ -availability if it can be recovered from $t$ disjoint repair sets of other symbols, each set of size at most $r$ . We refer a systematic code to an... View More