Faster implementation of canonical minimum redundancy prefix codes

K. L. Chung, Jung-Gen Wu

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This note modifies the data structure developed by Moffat and Turpin [3]. Besides reducing the memory requirement, the decoding algorithm is further improved. Experimental results demonstrate both the memory and decoding-time advantages of the modified method.

Original languageEnglish
Pages (from-to)341-345
Number of pages5
JournalJournal of Information Science and Engineering
Volume17
Issue number2
Publication statusPublished - 2001 Mar 1

Fingerprint

redundancy
Redundancy
Decoding
Data storage equipment
Data structures
time

Keywords

  • Algorithm
  • Canonical Huffman tree
  • Compression
  • Data structure
  • Huffman decoding

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Library and Information Sciences
  • Computational Theory and Mathematics

Cite this

Faster implementation of canonical minimum redundancy prefix codes. / Chung, K. L.; Wu, Jung-Gen.

In: Journal of Information Science and Engineering, Vol. 17, No. 2, 01.03.2001, p. 341-345.

Research output: Contribution to journalArticle

@article{da9e899bb2614237bbd4876e96cae552,
title = "Faster implementation of canonical minimum redundancy prefix codes",
abstract = "This note modifies the data structure developed by Moffat and Turpin [3]. Besides reducing the memory requirement, the decoding algorithm is further improved. Experimental results demonstrate both the memory and decoding-time advantages of the modified method.",
keywords = "Algorithm, Canonical Huffman tree, Compression, Data structure, Huffman decoding",
author = "Chung, {K. L.} and Jung-Gen Wu",
year = "2001",
month = "3",
day = "1",
language = "English",
volume = "17",
pages = "341--345",
journal = "Journal of Information Science and Engineering",
issn = "1016-2364",
publisher = "Institute of Information Science",
number = "2",

}

TY - JOUR

T1 - Faster implementation of canonical minimum redundancy prefix codes

AU - Chung, K. L.

AU - Wu, Jung-Gen

PY - 2001/3/1

Y1 - 2001/3/1

N2 - This note modifies the data structure developed by Moffat and Turpin [3]. Besides reducing the memory requirement, the decoding algorithm is further improved. Experimental results demonstrate both the memory and decoding-time advantages of the modified method.

AB - This note modifies the data structure developed by Moffat and Turpin [3]. Besides reducing the memory requirement, the decoding algorithm is further improved. Experimental results demonstrate both the memory and decoding-time advantages of the modified method.

KW - Algorithm

KW - Canonical Huffman tree

KW - Compression

KW - Data structure

KW - Huffman decoding

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

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

M3 - Article

AN - SCOPUS:0035275924

VL - 17

SP - 341

EP - 345

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 2

ER -