HMMT 2017 C9

Let $m$ be a positive integer, and let $T$ denote the set of all subsets of $\{1,2, \ldots, m\}$. Call a subset $S$ of $T \delta$-good if for all $s_{1}, s_{2} \in S, s_{1} \neq s_{2},\left|\Delta\left(s_{1}, s_{2}\right)\right| \geq \delta m$, where $\Delta$ denotes symmetric difference (the symmetric difference of two sets is the set of elements that is in exactly one of the two sets). Find the largest possible integer $s$ such that there exists an integer $m$ and a $\frac{1024}{2047}$-good set of size $s$.