Publication Type:

Journal Article


Communications in Nonlinear Science and Numerical Simulation, Volume 14, Number 4, p.1013 - 1020 (2009)



Source coding


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 Luröth 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.

Cite this Research Publication

N. Nagaraj, Vaidya, P. G., and Bhat, K. G., “Arithmetic coding as a non-linear dynamical system”, Communications in Nonlinear Science and Numerical Simulation, vol. 14, pp. 1013 - 1020, 2009.