𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Linear time adaptive arithmetic coding

✍ Scribed by Moffat, A.

Book ID
111886872
Publisher
IEEE
Year
1990
Tongue
English
Weight
612 KB
Volume
36
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Arithmetic coding as a non-linear dynami
Arithmetic coding as a non-linear dynamical system
✍ Nithin Nagaraj; Prabhakar G. Vaidya; Kishor G. Bhat πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 285 KB

In order to perform source coding (data compression), we treat messages emitted by independent and identically distributed sources as imprecise measurements (symbolic sequence) of a chaotic, ergodic, Lebesgue measure preserving, nonlinear dynamical system known as Generalized Luro Β¨th Series (GLS).

Adaptive arithmetic coding using fuzzy r
Adaptive arithmetic coding using fuzzy reasoning and grey prediction
✍ Pei-Yin Chen; Jer Min Jou πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 216 KB

Arithmetic coding is an attractive technique for lossless data compression. The most important thing in arithmetic coding is to construct a good modeler that always provides accurate probability estimation for incoming data. However, the characteristics of various types of source data bear a lot of

On the covering radius of cyclic linear
On the covering radius of cyclic linear codes and arithmetic codes
✍ Tor Helleseth πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 781 KB

The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem i n a finite field and to the theory of cyclotomic numbers. The methods devel oped l ead to new results for the covering radius of certain f-errorcorrecting BC