There are many parallels between the theory of doubly-even self-dual binary codes $C$ of length $n$ and the one of even unimodular lattices $L$ of dimension $n$. They only exist if $n$ is a multiple of $8$ and their minimum (weight) can be bounded from above by

\begin{displaymath}
d(C) \leq 4\lfloor \frac{n}{24} \rfloor + 4,~~ \mathrm{resp.}~ \min(L) \leq 2\lfloor \frac{n}{24} \rfloor + 2.
\end{displaymath}

Lattices (resp. codes) achieving equality are called extremal, these are of particular interest if $n$ is a multiple of 24.

For these $n$, there are just two extremal codes known, the extended quadratic residue codes of length 24 and 48, both are the unique extremal codes in their length. One intensively studied question is the existence of an extremal code of length 72. Using theoretical and computational methods one may show that the automorphism group of such an extremal code is rather small: its order is either 5 or divides 24.

The Leech lattice is the unique extremal lattice of dimension 24, in dimension 48 one knows 3 extremal lattices and there is at least one of dimension 72. It is an interesting question whether there are other extremal lattices of dimension 48. I will report on methods to narrow down the possible automorphisms of such lattices and on number theoretic computations to classify all lattices with an automorphism of order $a$ with $\varphi(a) > 24$.