Can someone explain to me how we measure the efficiency of a coding algorithm with regards to the question below?? Does it have to do with the entropy of the source?
Consider the following statement:
“ ‘If the information source is modeled correctly, Huffman coding is
guaranteed to be 100% efficient.”
Is this statement TRUE or FALSE? Give an example with a simple 3 symbol
information source to justify your answer.