Block arithmetic coding for source compression
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (5) , 1546-1554
- https://doi.org/10.1109/18.259639
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codesIEEE Transactions on Information Theory, 1992
- An overview of the basic principles of the Q-Coder adaptive binary arithmetic coderIBM Journal of Research and Development, 1988
- On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)IEEE Transactions on Information Theory, 1987
- Synchronization of binary source codes (Corresp.)IEEE Transactions on Information Theory, 1986
- An Introduction to Arithmetic CodingIBM Journal of Research and Development, 1984
- International digital facsimile coding standardsProceedings of the IEEE, 1980
- Huffman coding in bit-vector compressionInformation Processing Letters, 1978
- Generalized Kraft Inequality and Arithmetic CodingIBM Journal of Research and Development, 1976
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976
- On variable-length-to-block codingIEEE Transactions on Information Theory, 1972