No abstract

A complete classification of the perfect binary oneerror-correcting codes of length 15 as well as their extensions of length 16 was recently carried out in [P. R. J.Östergård and O. Pottonen, "The perfect binary one-error-correcting codes of length 15: Part I-Classification," IEEE Trans. Inform. Theory vol. 55, pp. 4657-4660, 2009]. In the current accompanying work, the classified codes are studied in great detail, and their main properties are tabulated. The results include the fact that 33 of the 80 Steiner triple systems of order 15 occur in such codes. Further understanding is gained on full-rank codes via switching, as it turns out that all but two full-rank codes can be obtained through a series of such transformations from the Hamming code. Other topics studied include (non)systematic codes, embedded one-error-correcting codes, and defining sets of codes. A classification of certain mixed perfect codes is also obtained.

No abstract

No abstract

The rank of a q-ary code C is the dimension of the subspace spanned by C. The kernel of a q-ary code C of length n can be defined as the set of all translations leaving C invariant. Some relations between the rank and the dimension of the kernel of q-ary 1-perfect codes, over F q = GF (q) as well as over the prime field F p , are established. Q-ary 1-perfect codes of length n = (q m − 1)/(q − 1) with different kernel dimensions using switching constructions are constructed and some upper and lower bounds for the dimension of the kernel, once the rank is given, are established.