  Graphical designs are an extension of spherical designs to functions on
graphs. We connect linear codes to graphical designs on cube graphs, and show
that the Hamming code in particular is a highly effective graphical design. We
show that even in highly structured graphs, graphical designs are distinct from
the related concepts of extremal designs, maximum stable sets in distance
graphs, and $t$-designs on association schemes.
