Optimal universal coding with respect to the maximal individual relative redundancy criterion

In this paper we consider the compaction of data generated by a binary memoryless source with fixed but unknown probabilities. We argue that in this case a relative redundancy criterion is a better measure for the code's performance than the absolute redundancy. We design universal fixed-to-variable length codes and variable-to-fixed length codes under the same conditions and compare their relative redundancy behavior