Given a $(K,n)$ D-ary block code $\mathcal{C}$, with encoder/decoder functions $(f,g)$, the reliability is measured via its probability of decoding error $P_e$: $$P_e:=P(g(f(X^n))\not=X^n)$$ we ideally want this to be as close to zero as possible.