Abstarct: The study of the perfect codes is important because of their interesting structure and properties. These codes are also very applicable in other sciences like telecommunication. In this thesis, we are going to show embedding and partitioning of 1 -perfect codes and constant-weight codes in the perfect code. We investigate embedding and partitioning in q-ary perfect codes. We will also indicate that 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, the result is generalized to partitions: every partition of the Hamming space into 1-error-correcting codes can be embedded in 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.\\ Moreover, we show that each q-ary constant-weight code of weight 3, minimum distance 4, and length $m$ embeds in a $q$-ary 1-perfect code of length $ n=(q^m)-1/(q-1).