𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On perfect arithmetic codes

✍ Scribed by Antoine C. Lobstein

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
239 KB
Volume
106-107
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

On perfect deletion-correcting codes
On perfect deletion-correcting codes
✍ Andreas Klein πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 84 KB

## Abstract In this article, we present constructions for perfect deletion‐correcting codes. The first construction uses perfect deletion‐correcting codes without repetition of letters to construct other perfect deletion‐correcting codes. This is a generalization of the construction shown in 1. In

On the insecurity of arithmetic coding
On the insecurity of arithmetic coding
✍ John G. Cleary; Sean A. Irvine; Ingrid Rinsma-Melchert πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 863 KB
On the Finite-Precision Implementation o
On the Finite-Precision Implementation of Arithmetic Codes
✍ 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