We present constructions of bases for a Hamming code having small widt
h and height, i.e. number of Is in each row and column in the correspo
nding matrix. Apart from being combinatorially interesting in their ow
n right, these bases also lead to improved embeddings of a hypercube o
f cliques into a same-sized hypercube.