Thumbnail
Access Restriction
Subscribed

Author Yohe, J. M.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Coding theory ♦ Hu-tucker method ♦ Minimum redundancy coding ♦ Information theory
Abstract This algorithm implements the Hu-Tucker method of variable length, minimum redundancy alphabetic binary encoding [1]. The symbols of the alphabet are considered to be an ordered forest of n terminal nodes. Two nodes in an ordered forest are said to be tentative-connecting if the sequence of nodes between the two given nodes is either empty or consists entirely of nonterminal nodes.
Description Affiliation: Univ. of Wisconsin, Madison (Yohe, J. M.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 15
Issue Number 5
Page Count 3
Starting Page 360
Ending Page 362


Open content in new tab

   Open content in new tab
Source: ACM Digital Library