The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes
The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes
Maximally recoverable codes are codes designed for distributed storage which combine quick recovery from single node failure and optimal recovery from catastrophic failure. Gopalan et al [SODA 2017] studied the alphabet size needed for such codes in grid topologies and gave a combinatorial characterization for it. Consider a labeling of …