Minimizing excess code length and VLSI complexity in the multiplication free approximation of arithmetic coding
- 31 December 1994
- journal article
- Published by Elsevier in Information Processing & Management
- Vol. 30 (6) , 805-816
- https://doi.org/10.1016/0306-4573(94)90008-6
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- An overview of the basic principles of the Q-Coder adaptive binary arithmetic coderIBM Journal of Research and Development, 1988
- A simple general binary source code (Corresp.)IEEE Transactions on Information Theory, 1982
- Compression of Black-White Images with Arithmetic CodingIEEE Transactions on Communications, 1981
- Universal modeling and codingIEEE Transactions on Information Theory, 1981