Universal coding for discrete memoryless sources uniform with respect to output (Q809982): Difference between revisions

The paper deals with the redundancy analysis of unversal coding for discrete memoryless sources. It uses and extends some earlier results related to universal coding for memoryless sources (e.g. see papers done by \textit{T. C. Lawrence}, \textit{B. M. Fitingraf} or \textit{W. K. Trofimov}). The coding redundancy, i.e., the difference between the coding rate and the average source entropy is described as a function of the average coding delay. Its accurate formulae for the so-called asymptotically optimum coding are found. To prove the correctness of these formulae and other properties of universal coding some random code features as well as combinatorial elements, e.g. Stirling formulae, are applied.