Thin code conjecture for binary linear codes
Let C⊆F2n\mathcal{C}\subseteq\mathbb{F}_2^nC⊆F2n be a linear code. A hitting set for C\mathcal{C}C is a set S⊆[n]S\subseteq[n]S⊆[n] such that cS≠0c_S\neq0cS=0 for every nonzero codeword…