Information Theory and Coding Theory

Methods of Constructing Lower Bounds for Redundancy of Universal Coding

Yu. M. Shtar'kov


Abstract: The article proposes a new approach to the construction of lower bounds for the redundancy of universal coding. A relationship to the problem of choosing reliably discriminable hypotheses is established, and some examples are considered.

UDC: 621.391.15:519.28

Received: 16.01.1981
Revised: 14.12.1981

 English version: Problems of Information Transmission, 1982, 18:2, 85–92

Bibliographic databases:

• 
•