Embedding in $q$-ary $1$-perfect codes and partitions

TL;DR

This paper demonstrates that any 1-error-correcting code over a finite field can be embedded into a larger 1-perfect code, and extends this to partitions, with near-optimal embedding lengths.

Contribution

It proves the existence of embeddings of arbitrary 1-error-correcting codes and partitions into larger 1-perfect codes, generalizing previous results and providing bounds.

Findings

Every 1-error-correcting code can be embedded into a larger 1-perfect code.

Partitions of Hamming space into 1-error-correcting codes can be embedded into partitions into 1-perfect codes.

Embedding lengths are close to the theoretical bounds, optimal in the binary case.

Abstract

We prove that every $1$-error-correcting code over a finite field can be embedded in a $1$-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting $1$-perfect code and can be obtained from it by repeated shortening. Further, we generalize the results to partitions: every partition of the Hamming space into $1$-error-correcting codes can be embedded in a partition of a space of some larger dimension into $1$-perfect codes. For the partitions, the embedding length is close to the theoretical bound for the general case and optimal for the binary case. Keywords: error-correcting code, $1$-perfect code, $1$-perfect partition, embedding