A multiplication-free multialphabet arithmetic code
A fixed arithmetic code using these same frequencies would give better performance; adapting the frequencies to each particular document would be better still.
The reader interested in the broader class of arithmetic codes is referred to ; a tutorial is available in .
segments are effectively executed by the specialized support of the Hammer architecture, which goes beyond smaller primitives with interconnect restrictions found in FPGA-based architectures.
The class of arithmetic codes
we introduce in this paper is perhaps the most important subclass of the Leonard completely regular codes in the Hamming graphs and something similar is likely true for the other classical families, but this investigation is left as an open problem.
This improved compression is possible because arithmetic codes
are not constrained to map an integer number of bits to each dictionary entry.