I Entropy and coding

For {pi}i=1,n being the probability distribution, I want to show that a Huffman reduction cannot be decreasing, and I reached a point where I need to show that

q+H(p1,...,pn-s,q) ≥ H(p1,...,pn), where

q = pn-s+1 + ... + pn and s is chosen such that: 2 ≤ s ≤ m (m≥n) and s = n (mod(m-1))

where m is the number of m-arr symbols from a Huffmann m-arr algorithm.
Thanks for the thread! This is an automated courtesy bump. Sorry you aren't generating responses at the moment. Do you have any further information, come to any new conclusions or is it possible to reword the post? The more details the better.

Want to reply to this thread?

"Entropy and coding" You must log in or register to reply here.

Physics Forums Values

We Value Quality
• Topics based on mainstream science
• Proper English grammar and spelling
We Value Civility
• Positive and compassionate attitudes
• Patience while debating
We Value Productivity
• Disciplined to remain on-topic
• Recognition of own weaknesses
• Solo and co-op problem solving