Question

nder a Huffman encoding ofnsymbols with frequenciesf1, f2, . . . , fn, what is the longest a codewordcould possibly be

Answer 1

The longest codeword that could possibly be for "n" symbol is n-1 bits.

Step-by-step explanation:

From the given information:

Suppose we are to consider a set of frequencies
`\mathtt{f_1,f_2,f_3 ...,f_n}`, for which f is a symbol for the length n. Therefore, the longest codeword that could possibly be for "n" symbol is n-1 bits.

However, during the encoding for "n" in conjunction with n-2, then the possibilities for n are;
`\mathtt{(1)/(2), (1)/(4), ... (1)/(2^(n-2))}`

We can conclude that the longest codeword that could possibly be for "n" symbol is n-1 bits.