Finite families with few symmetric differences

We show that $2^{\lceil \log _2 (m) \rceil}$ is the least number of symmetric differences that a family of $m$ sets can produce. Furthermore we give two characterizations of the set-theoretic structure of the families for which that lower bound is actually attained.