Here is a list of code families which contain perfect codes.
Code Description
Binary Golay code A $$[23, 12, 7]$$ perfect binary linear code with connections to the theory of sporadic simple groups. Adding a parity bit to the code results in the $$[24, 12, 8]$$ extended Golay code. The codespace is a 12-dimensional linear subspace of $$GF(2)^{23}$$, or $$GF(2)^{24}$$ in the extended case.
Binary repetition code $$[n,1,n]$$ binary linear code encoding one bit of information into an $$n$$-bit string. The length $$n$$ needs to be an odd number, since the receiver will pick the majority to recover the information. The idea is to increase the code distance by repeating the logical information several times. It is a $$(n,1)$$-Hamming code.
Graph homology code This code's properties are derived from the size two chain complex associated with a particular graph. Given a connected simplicial (no self loops or muliedges) graph $$G = (V, E)$$, which is not a tree, with incidence matrix $$\Gamma$$ we can construct a code by choosing a parity check matrix which consists of all the linearly independent rows of $$\Gamma$$. This is a $$[n,k,d]$$ code with $$n = |E|$$, $$k = 1 - \mathcal{X}(G) = 1-|V|+|E|$$, where $$\mathcal{X}(G)$$ is the euler characteristic of the graph. The code distance is equal to the shortest size of a cycle, guaranteed to exist since $$G$$ is not a tree.
Hamming code An infinite family of perfect linear codes with parameters $$(2^r-1,2^r-r-1, 3)$$ for $$r \geq 2$$. Their $$r \times (2^r-1)$$ parity check matrix $$H$$ has all possible non-zero $$r$$-bit strings as its columns.
Perfect code An $$(n,K,2t+1)_q$$ $$q$$-ary code is perfect if parameters $$n$$, $$K$$, $$t$$, and $$q$$ are such that the Hamming (a.k.a. sphere-packing) bound \begin{align} \sum_{j=0}^{t}(q-1)^{j}{n \choose j}\leq q^{n}/K \end{align} becomes an equality. For example, for a binary $$q=2$$ code with one logical bit ($$K=2$$) and $$t=1$$, the bound becomes $$n+1 \leq 2^{n-1}$$. Any perfect linear code is either a repetition code, a Hamming code, or a binary or ternary Golay code.
Perfect quantum code A non-degenerate code constructed out of $$q$$-dimensional qudits and having parameters $$((n,K,2t+1))$$ is perfect if $$n$$, $$K$$, $$t$$, and $$q$$ are such that the quantum Hamming bound \begin{align} \sum_{j=0}^{t}(q^2-1)^{j}{n \choose j}\leq q^{n}/K \end{align} becomes an equality. For example, for a qubit $$q=2$$ code with one logical qubit ($$K=2$$) and $$t=1$$, the bound becomes $$3n+1 \leq 2^{n-1}$$. The bound can be saturated only at certain $$n$$.
Zetterberg code Family of binary cyclic $$[2^{2s}+1,2^{2s}-4s+1]$$ codes with distance $$d>5$$ generated by the minimal polynomial $$g_s(x)$$ of $$\alpha$$ over $$GF(2)$$, where $$\alpha$$ is a primitive $$n$$th root of unity in the field $$GF(2^{4s})$$. They are quasi-perfect codes and are one of the best known families of double-error correcting binary linear codes