.png){kind=icon}
Return
Arithmetic coding as a non-linear dynamical system
.png){kind=icon}
OA
AI
DOI：10.1016/j.cnsns.2007.12.001.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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, non-linear dynamical system known as Generalized Luroth Series (GLS). GLS achieves Shannon's entropy bound and turns out to be a generalization of arithmetic coding, a popular source coding algorithm, used in international compression standards such as JPEG2000 and H.264. We further generalize GLS to piecewise non-linear maps (Skewed-nGLS). We motivate the use of Skewed-nGLS as a framework for joint source coding and encryption. (c) 2007 Elsevier B.V. All rights reserved.
Keywords:
Data compression
Encryption
Chaotic map
Arithmetic coding
Source coding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
9.2K
Citations:
1.8W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveFacile hydroxyl-assisted synthesis of morphological Cu2O architectures and their shape-dependent photocatalytic performances.png)
New J. Chem.
New J. Chem.IF0
PREAI
ShareSaveShareSaveShareSaveShareSave no more
no more