Classification of perfect and total perfect codes in generalized Petersen graphs

In a graph $\mathrm{\Gamma }$, a perfect code is an independent set $C$ with the property that every vertex not in $C$ is adjacent to a unique vertex in $C$, and a total perfect code is a set $C$ of vertices of $\mathrm{\Gamma }$ such that every vertex of $\mathrm{\Gamma }$ is adjacent to a unique vertex in $C$. We classify these codes for generalized Petersen graphs.