DIRECT HUFFMAN CODING AND DECODING USING THE TABLE OF

Gespeichert in:
Bibliographische Detailangaben
Titel: DIRECT HUFFMAN CODING AND DECODING USING THE TABLE OF
Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives
Quelle: http://csdl.computer.org/comp/proceedings/itcc/2003/1916/00/19160237.pdf.
Bestand: CiteSeerX
Beschreibung: A new Huffman coding and decoding technique is presented. There is no need to construct a full size Huffman table in this technique; instead, the symbols are encoded directly from the table of code-lengths. For decoding purposes a new Condensed Huffman Table (CHT) is also introduced. It is shown that by employing this technique both encoding and decoding operations become significantly faster, and the memory consumption also becomes much smaller compare to the normal Huffman coding/decoding. 1.
Publikationsart: text
Dateibeschreibung: application/pdf
Sprache: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.5595; http://csdl.computer.org/comp/proceedings/itcc/2003/1916/00/19160237.pdf
Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.5595
http://csdl.computer.org/comp/proceedings/itcc/2003/1916/00/19160237.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Dokumentencode: edsbas.64CC844E
Datenbank: BASE
Beschreibung
Abstract:A new Huffman coding and decoding technique is presented. There is no need to construct a full size Huffman table in this technique; instead, the symbols are encoded directly from the table of code-lengths. For decoding purposes a new Condensed Huffman Table (CHT) is also introduced. It is shown that by employing this technique both encoding and decoding operations become significantly faster, and the memory consumption also becomes much smaller compare to the normal Huffman coding/decoding. 1.