A computer study of some 1-error correcting perfect binary codes

A general algrothm for classifying 1-error correction perfect binary codes of length n, rank n – log2(n+1)+1 and kernel of dimension n – log2/n+1) – 2 is presented. The algorithm gives for n = 31.