Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #2 to TR17-033 | 28th March 2017 02:00

The independence number of the Birkhoff polytope graph, and applications to maximally recoverable codes

RSS-Feed




Revision #2
Authors: Daniel Kane, Shachar Lovett, Sankeerth Rao
Accepted on: 28th March 2017 02:00
Downloads: 238
Keywords: 


Abstract:

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 the edges of the complete bipartite graph $K_{n,n}$ with labels coming from $F_2^d$ , that satisfies the following condition: for any simple cycle, the sum of the labels over its edges is nonzero. The minimal d where this is possible controls the alphabet size needed for maximally recoverable codes in $n×n$ grid topologies.

Prior to the current work, it was known that d is between $(\log n)^2$ and $n\logn$. We improve both bounds and show that d is linear in n. The upper bound is a recursive construction which beats the random construction. The lower bound follows by first relating the problem to the independence number of the Birkhoff polytope graph, and then providing tight bounds for it using the representation theory of the symmetric group.


Revision #1 to TR17-033 | 28th March 2017 01:55

The independence number of the Birkhoff polytope graph, and applications to maximally recoverable codes





Revision #1
Authors: Daniel Kane, Shachar Lovett, Sankeerth Rao
Accepted on: 28th March 2017 01:55
Downloads: 34
Keywords: 


Abstract:

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 the edges of the complete bipartite graph $K_{n,n}$ with labels
coming from $F_2^d$ , that satisfies the following condition: for any simple cycle, the sum
of the labels over its edges is nonzero. The minimal d where this is possible controls
the alphabet size needed for maximally recoverable codes in $n×n$ grid topologies.
Prior to the current work, it was known that d is between $(log n)^2$ and $nlogn$. We
improve both bounds and show that d is linear in n. The upper bound is a recursive
construction which beats the random construction. The lower bound follows by first
relating the problem to the independence number of the Birkhoff polytope graph, and
then providing tight bounds for it using the representation theory of the symmetric
group.


Paper:

TR17-033 | 19th February 2017 19:21

Labeling the complete bipartite graph with no zero cycles





TR17-033
Authors: Daniel Kane, Shachar Lovett, Sankeerth Rao
Publication: 19th February 2017 20:38
Downloads: 261
Keywords: 


Abstract:

Assume that the edges of the complete bipartite graph $K_{n,n}$ are labeled with elements of $\mathbb{F}_2^d$, such that the sum over
any simple cycle is nonzero. What is the smallest possible value of $d$? This problem was raised by Gopalan et al. [SODA 2017] as it characterizes the alphabet size needed for maximally recoverable codes in grid topologies.

We show that the answer is that $d$ is linear in $n$. The upper bound is an explicit construction which improves upon the random construction. The lower bound is more technical, and relies on the study of independent sets in certain Cayley graphs of the permutation group.



ISSN 1433-8092 | Imprint