TY - GEN

T1 - Huffman coding with non-sorted frequencies

AU - Klein, Shmuel T.

AU - Shapira, Dana

PY - 2008

Y1 - 2008

N2 - A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are investigated as to the consequences of relaxing the requirement of keeping the frequencies in order. Using only partial order may speed up the code construction, which is important in some applications, at the cost of increasing the size of the encoded file.

AB - A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are investigated as to the consequences of relaxing the requirement of keeping the frequencies in order. Using only partial order may speed up the code construction, which is important in some applications, at the cost of increasing the size of the encoded file.

UR - http://www.scopus.com/inward/record.url?scp=84869124944&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84869124944

SN - 9788001041451

T3 - Proceedings of the Prague Stringology Conference 2008

SP - 46

EP - 53

BT - Proceedings of the Prague Stringology Conference 2008

T2 - Prague Stringology Conference 2008, PSC 2008

Y2 - 1 September 2008 through 3 September 2008

ER -