Perhaps I am not saying anything new to you here, but in coding theory one is interested in upper bounds on the clique number of $\overline{H}_n^k$, as such cliques are exactly binary codes of minimal distance $k$. There is huge amount of literature on this.

And such bounds are lower bounds on $\chi(\overline{H}_n^k)$.