Define the binary Hamming code of length $n=2^{l}-1$ for $l \geqslant 3$. Define a perfect code. Show that a binary Hamming code is perfect.

What is the weight of the dual code of a binary Hamming code when $l=3 ?$