Abstract:
Advantages of the relative redundancy criterion are discussed. Two types of universal (with respect to this criterion) codes are proposed. It is proved that, for the set of binary memoryless sources, variable-to-fixed length codes are more efficient than fixed-to-variable length codes if the number of encoded messages is the same.