The Satisfiability Threshold for K-XOR Games

A $K$-XORGAME system corresponds to a $K$-XORSAT system with the additional restriction that the variables divide uniformly into $K$ blocks. This forms a system of $m$ equations with $Kn$ unknowns over ${\mathbb{Z}}_2$, and a perfect strategy corresponds to a solution to these equations. Equivalently, such equations correspond to colorings of a $K$-uniform $K$-partite hypergraph. This paper proves that the satisfiability threshold of $m\mathrm{/}n$ for $K$-XORGAME problems exists and equals the satisfiability threshold for $K$-XORSAT.