A note on binary completely regular codes with large minimum distance

We classify all binary error correcting completely regular codes of length $n$ with minimum distance $\delta >n\mathrm{/}2$.