Error exponent in the context of "Information theory"

In information theory, the error exponent of a channel code or source code over the block length of the code is the rate at which the error probability decays exponentially with the block length of the code. Formally, it is defined as the limiting ratio of the negative logarithm of the error probability to the block length of the code for large block lengths. For example, if the probability of error ${\displaystyle P_{\mathrm {error} }}$ of a decoder drops as ${\displaystyle e^{-n\alpha }}$, where ${\displaystyle n}$ is the block length, the error exponent is ${\displaystyle \alpha }$. In this example, ${\displaystyle {\frac {-\ln P_{\mathrm {error} }}{n}}}$ approaches ${\displaystyle \alpha }$ for large ${\displaystyle n}$. Many of the information-theoretic theorems are of asymptotic nature, for example, the channel coding theorem states that for any rate less than the channel capacity, the probability of the error of the channel code can be made to go to zero as the block length goes to infinity. In practical situations, there are limitations to the delay of the communication and the block length must be finite. Therefore, it is important to study how the probability of error drops as the block length go to infinity.