40 search results - page 2 / 8 » Reserved-Length Prefix Coding |
ITCC
2003
IEEE
13 years 10 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...
DCC
2007
IEEE
14 years 4 months ago
2007
IEEE
Many data compression methods cannot remove all redundancy from a file that they compress because it can be encoded to many compressed files. In particular, we consider the redund...
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
SIAMDM
2010
13 years 3 months ago
2010
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
DCC
2003
IEEE
14 years 4 months ago
2003
IEEE
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...