Analysis of Efficiency of Universal Coding as a Function of the Block Length

We estimate the efficiency of universal coding of nonexponential complexity as a function of a block length $n$. We show that accounting of the nonmonotone behavior of the coding redundancy as a function of the length of an $n$-block reduces the coding complexity. We also estimate the airborne usability of this coding.