The equivalence of certain equidistant binary codes and symmetric BIBDS (Q761462)

It has been shown that a symmetric BIBD with parameters \((2u^ 2+2u+1,u^ 2,\left( \begin{matrix} u\\ 2\end{matrix} \right))\) implies the existence of maximum size 4k, of an equidistant code of length \(4k+1\) having weight 2k and distance 2k between codewords, for \(k=\left( \begin{matrix} u+1\\ 2\end{matrix} \right)\) and u a positive integer.