Fast codes for large alphabet sources and its application to block encoding

In this paper we suggest a method of grouping for speeding up codes depending on the alphabet size. The method of grouping is applied to the set of all possible blocks in such a way to reduce redundancy and the computational efficiency of lossless data compression for large alphabets is presented in this paper.