Hi all, Pls help me with the following problem.. Generalize Huffman s algorithm to ternary codewords(i.e codewords using the symbols 0,1,2) and prove tht it yeilds optimal ternary codes Thanks in advance
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
