Multi-Alphabet Universal Coding of Memoryless Sources

The universal coding of memoryless sources is considered in the case where its redundancy depends on the number of different letters in the message to be encoded. The coding method is analyzed and shown to be close to optimal. Some modifications of this method for sequential arithmetic coding are developed and compared with known algorithms.