Kernels and p-kernels of p(r)-ary 1-perfect codes
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.
kernel rank q-ary codes perfect codes nonlinear codes