A remark on full rank perfect codes

Any full rank perfect 1-error correcting binary code of length n=2^k-1 and with a kernel of dimension n-log(n+1)-m, where m is sufficiently large, may be used to construct a full rank perfect 1-error correcting binary code of length 2^m-1 and with a kernel of dimension n-log(n+1)-k. Especially we may construct full rank perfect 1-error correcting binary codes of length n=2^m-1 and with a kernel of dimension n-log(n+1)-4 for m=6,7,...,10. This result extends known results on the possibilities for the size of a kernel of a full rank perfect code.

[1]  Alexander Vardy,et al.  Tilings of Binary Spaces , 1996, SIAM J. Discret. Math..

[2]  Alexander Vardy,et al.  On Perfect Codes and Tilings: Problems and Solutions , 1998, SIAM J. Discret. Math..

[3]  Kevin T. Phelps,et al.  On Perfect Codes: Rank and Kernel , 2002, Des. Codes Cryptogr..

[4]  Sergey V. Avgustinovich,et al.  On the Ranks and Kernels Problem for Perfect Codes , 2003, Probl. Inf. Transm..

[5]  Alexander Vardy,et al.  Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces , 2005, SIAM J. Discret. Math..