A perfect code in a graph $\Gamma =(V,E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V\setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a subgroup perfect code of $G$ if there exists a Cayley graph of $G$ which admits $H$ as a perfect code. Equivalently, $H$ is a subgroup perfect code of $G$ if there exists an inverse-closed subset $A$ of $G$ containing the identity element such that $(A,H)$ is a tiling of $G$ in the sense that every element of $G$ can be uniquely expressed as the product of an element of $A$ and an element of $H$. In this paper we obtain multiple results on subgroup perfect codes of finite groups, including a few necessary and sufficient conditions for a subgroup of a finite group to be a subgroup perfect code, a few results involving 2-subgroups in the study of subgroup perfect codes, and several results on subgroup perfect codes of metabelian groups, generalized dihedral groups, nilpotent groups and 2-groups.

图中的完美代码 $\Gamma =（V，Ë）$ 是一个子集 $C$ 的 $V$ 这样在其中没有两个顶点 $C$ 是相邻的，并且每个顶点 $V\setminus C$ 恰好与中的一个顶点相邻 $C$。一个小组$H$ 一群 $G$ 被称为 $G$ 如果存在以下的Cayley图 $G$ 哪个承认 $H$作为完美的代码。等效地，$H$ 是一个完美的子组代码 $G$ 如果存在反闭合子集 $\mathrm{一种}$ 的 $G$ 包含标识元素，使得 $（\mathrm{一种}，H）$ 是的 $G$ 在某种意义上说 $G$ 可以唯一表示为元素的乘积 $\mathrm{一种}$ 和一个元素 $H$。在本文中，我们获得了关于有限群的子群完美码的多个结果，包括将有限群的子群变为子群完美码的一些充要条件，在子群完美码的研究中，涉及2个子群的一些结果，以及关于metabelian群，广义二面体群，幂等群和2群的子群完美代码的几个结果。