  The Paley graph is a well-known self-complementary pseudo-random graph,
defined over a finite field of odd order. We describe an attempt at an
analogous construction using fields of even order. Some properties of the graph
are noted, such as the existence of a Hamiltonian decomposition.
