Fast codes for large alphabets (Q2387135)

In this paper the method for speeding up codes is based on an idea of a new scheme which is described as follows: Letters of the alphabet are grouped with small probabilities in subsets, acting as super letters having the same length, as three sets to all letters of the set. Then the use of time consuming coding for these subsets only can be coded fast (data compressed). Such grouping can increase the redundancy of the code, but decrease the alphabet size. This can cause a relatively small increase in redundancy. This method can be applied to any sources of coding.