Analysis of lossless compression for a large class of sources of information

We analyze the lossless compression for a large class of discrete complete and memoryless sources performed by a generalized Huffman with an alphabet consisting of M letters. Given the number of source messages, N, the alphabet size, M, and the number of code words, p, on each level in the graph, excepting the last two ones, we have determined the unknown encoding parameters, that is, the number n of the levels in the encoding graph, the number q of code words on the level n-1, the number k of groups of M nodes, and the remaining m nodes on the last level. The average code word length is also computed. Two extreme cases, when p=0 and p=M-1 have been analyzed.