On two doubly even self-dual binary codes of length 160 and minimum weight 24

This correspondence revisits the idea of constructing a binary [mn,mk] code from an [n,k] code over F₂^m by concatenating the code with a suitable basis representation of F₂^m over F₂. We construct two nonequivalent examples of doubly even self-dual binary codes of length 160 which turn out to be of minimum distance 24. This improves the lower bound for this class of codes, whereas the upper bound is given by 28. The construction at hand seems to be of interest beyond this particular example.