Answers are grounded in this paper and cite their sources.
Arithmetic coding is a highly efficient lossless source coding technique. Multiplication-free arithmetic coding algorithms provide an excellent tradeoff between operation complexity and coding performance. A whole family of multiplication-free arithmetic codes, which achieve the best coding efficiency and can be used for arbitrary size of alphabets, is derived. The complete tradeoff between the complexity of operations and compression performance of all the algorithms is presented.
No takes yet. Share an insight, caveat, or question.
Fu et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: