๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the insecurity of arithmetic coding

โœ Scribed by John G. Cleary; Sean A. Irvine; Ingrid Rinsma-Melchert


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
863 KB
Volume
14
Category
Article
ISSN
0167-4048

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On perfect arithmetic codes
โœ Antoine C. Lobstein ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 239 KB

Lobstein, A.C., On perfect arithmetic codes, Discrete Mathematics 106/107 (1992) 333-336 This short paper treats the perfect codes, in the case of arithmetic codes and Garcia-Rao modular distance.

On the Finite-Precision Implementation o
โœ Shaw-Min Lei ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 439 KB

Arithmetic coding is a powerful lossless data compression technique that has attracted much attention in recent years. It provides more flexibility and better efficiency than the celebrated Huffman coding does. In this paper, we discuss many issues on the finite-precision implementation of arithmeti