2 problems

Functional Batch Conjecture. The binary $[k,2^k-1]$ simplex code is a $2^{k-1}$-functional batch code.

Ballinger et al.'s conjecture. Ballinger et al. conjecture that the construction obtained from such a matrix $S$ gives the optimal code in every dimension.