Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,312,399 papers from all fields of science
Search
Sign In
Create Free Account
Package-merge algorithm
The package-merge algorithm is an O(nL)-time algorithm for finding an optimal length-limited Huffman code for a given distribution on a given…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Canonical Huffman code
Change-making problem
Code word
Data compression
Expand
Broader (1)
Coding theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Approach for Name Ambiguity Problem Using a Multiple-Layer Clustering
Wenrong Jiang
,
Anbao Wang
,
Cuihong Wu
,
Jing Chen
,
Jihong Yan
International Conference on Computational Science…
2009
Corpus ID: 18001979
Name ambiguity refers to the problem of attributing a publication to a proper author. This is a common issue in digital library…
Expand
2006
2006
Twenty (or so) Questions: $D$-ary Length-Bounded Prefix Coding
M. Baer
arXiv.org
2006
Corpus ID: 15670448
Efficient optimal prefix coding has long been accomplished via the Huffman algorithm. However, there is still room for…
Expand
2001
2001
Length-restricted coding using modified probability distributions
M. Liddell
,
Alistair Moffat
Proceedings 24th Australian Computer Science…
2001
Corpus ID: 30354018
The use of data compression has long been a central part of text databases and fast communication protocols. In many contexts…
Expand
1995
1995
Space-efficient construction of optimal prefix codes
Alistair Moffat
,
A. Turpin
,
J. Katajainen
Proceedings DCC '95 Data Compression Conference
1995
Corpus ID: 45606978
Shows that the use of the lazy list processing technique from the world of functional languages allows, under certain conditions…
Expand