Byte-Oriented Canonical Huffman Coding  

Oleh:

Kusnadi

Jenis: Article from Journal - ilmiah nasional
Dalam koleksi: Jurnal Teknologi Industri vol. 7 no. 3 (Jul. 2003), page 179-190.
Topik: Data Compression; Huffinan Coding; Minimum Redundancy Coding

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: JJ83.4 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

Canonical Huffinan coding is considered quite optimal for lossless compression; in the case that encoder can operate off-line. However, because generally canonical Huffinan coding is bit-oriented, it is considered rather slow in term of decoding time. In this paper, byte-oriented scheme is employed to gain faster decoding with loss of some compression. Other fast non-entropy coders are also discussed for comparisons.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali