39 search results - page 1 / 8 » Fast and Compact Prefix Codes |
SOFSEM
2010
Springer
13 years 8 months ago
2010
Springer
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
DCC
2010
IEEE
14 years 2 months ago
2010
IEEE
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
ISAAC
1995
Springer
14 years 2 months ago
1995
Springer
Abstract. The minimum-redundancy prefix codeproblem is to deter
ITCC
2003
IEEE
14 years 4 months ago
2003
IEEE
As large main memory becomes more and more available at reasonable prices, processing speed of large data sets becomes more important than reducing main memory usage of internal d...
CN
2004
13 years 10 months ago
2004
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...