Here is a list of binary linear 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.
Expander code Expander codes are binary linear codes whose parity check matrices are derived from the adjacency matrix of bipartite expander graphs. In particular, the rows of the parity check matrix correspond to the right nodes of the bipartite graph and the columns correspond to the left nodes. The codespace is equivalent to all subsets of the left nodes in the graph that have an even number of edges going into every right node of the graph. Since the expander graph is only left regular, these codes do not qualify as LDPC codes.
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.
Hadamard code The Hadamard code is dual to the extended Hamming Code.
Justesen code Binary code resulting from generalized concatenation of a Reed-Solomon (RS) outer code with multiple inner codes sampled from the Wozencraft ensemble, i.e., $$N$$ distinct binary inner codes of dimension $$m$$ and length $$2m$$. Justesen codes are parameterized by $$m$$, with length $$n=2mN$$ and dimension $$k=mK$$, where $$(N=2^m-1,K)$$ is the RS outer code over $$GF(2^m)$$.
Linear binary code An $$(n,2^k,d)$$ linear code is denoted as $$[n,k]$$ or $$[n,k,d]$$, where $$d$$ is the code's distance. Its codewords form a linear subspace, i.e., for any codewords $$x,y$$, $$x+y$$ is also a codeword. A code that is not linear is called nonlinear.
Parity-check code Stub.
Polar code In its basic version, a binary linear polar code encodes $$K$$ message bits into $$N=2^n$$ bits. The linear transformation that defines the code is given by the matrix $$G^{(n)}=B_N G^{\otimes n}$$, where $$B_N$$ is a certain $$N\times N$$ permutation matrix, and $$G^{\otimes n}$$ is the $$n$$th Kronecker power of the $$2\times 2$$ kernel matrix $$G=\left[\begin{smallmatrix}1 & 0\\ 1 & 1 \end{smallmatrix}\right]$$. To encode $$K$$ message bits, one forms an $$N$$-vector $$u$$ in which $$K$$ coordinates represent the message bits. The remaining $$N-K$$ coordinates are set to some fixed values and are said to be frozen. The codeword $$x \in \{0,1\}^N$$ is obtained as $$x=u G^{\otimes n}$$.
Reed-Muller (RM) code Stub. Define first order ($$r=1$$) and second order.
Single parity-check code An $$[n,n-1,2]$$ binary linear error-detecting code encoding an $$n$$-bit codeword into an $$(n+1)$$-bit string. In this code, parity information of a codeword is sotred in an extra parity bit. If the Hamming weight of a codeword is odd, then its parity is 1. If the Hamming weight of a codeword is even, then its parity is 0. This code is inexpensive since it only requires an extra parity bit and a single parity check.
Tanner code Binary linear code defined on edges on a regular graph $$G$$ such that each subsequence of bits corresponding to edges in the neighborhood any vertex belong to some short binary linear code $$C_0$$. Expansion properties of the underlying graph can yield efficient decoding algorithms.
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