Perfect $2$-codes over arbitrary alphabets

Michael A. Bennett

The classification of perfect $e$-codes over an arbitrary alphabet of size $q$ is complete for $e>2$. In the case of non prime power $q$, it is conjectured that no perfect $2$-co…