𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The universal coding method in the data compression algorithm

✍ Scribed by N. K. Kasumov

Book ID
111496436
Publisher
Allerton Press Inc
Year
2010
Tongue
English
Weight
204 KB
Volume
44
Category
Article
ISSN
0146-4116

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An improvement in the pointer coding of
An improvement in the pointer coding of LZ77 data compression method
✍ Hideotoshi Yokoo πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 816 KB

## Abstract There are essentially two approaches in the Ziv‐Lempel code to be used in the data compression. They have already been proposed also as the improvements of the Ziv‐Lempel code, which can be considered as combinations of the two methods. This paper shows that by executing the combination

Data compression using the deconvolution
Data compression using the deconvolution algorithm CLEAN
✍ Nathan Cohen; Guido Sandri πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 396 KB

We describe an application of the nonlinear deconvolution algorithm CLEAN in which a priori knowledge of the point-spread function allows transmission of nonredundant information. We refer to this as CLEAN compression. The point-spread function is viewed as a redundancy function. The data set may be