TY - JOUR
T1 - Huffman coding with non-sorted frequencies
AU - Klein, Shmuel T.
AU - Shapira, Dana
PY - 2008/12/1
Y1 - 2008/12/1
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. © 2008 Czech Technical University in Prague, Czech Republic.
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. © 2008 Czech Technical University in Prague, Czech Republic.
UR - http://www.scopus.com/inward/record.url?scp=84869124944&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
JO - Proceedings of the Prague Stringology Conference 2008
JF - Proceedings of the Prague Stringology Conference 2008
ER -