Arithmetic coding as a non-linear dynamical system

DOI10.1142/S0218127411029392zbMATH Open1221.94037arXiv0906.3575OpenAlexW2020767010MaRDI QIDQ716619FDOQ716619

Kishor G. Bhat, P. G. Vaidya, Nithin Nagaraj

Publication date: 30 September 2011

Published in: Communications in Nonlinear Science and Numerical Simulation, International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)

Abstract: In this paper, source coding or data compression is viewed as a measurement problem. Given a measurement device with fewer states than the observable of a stochastic source, how can one capture the essential information? We propose modeling stochastic sources as piecewise linear discrete chaotic dynamical systems known as Generalized Lur"{o}th Series (GLS) which dates back to Georg Cantor's work in 1869. The Lyapunov exponent of GLS is equal to the Shannon's entropy of the source (up to a constant of proportionality). By successively approximating the source with GLS having fewer states (with the closest Lyapunov exponent), we derive a binary coding algorithm which exhibits minimum redundancy (the least average codeword length with integer codeword lengths). This turns out to be a re-discovery of Huffman coding, the popular lossless compression algorithm used in the JPEG international standard for still image compression.

Full work available at URL: https://arxiv.org/abs/0906.3575

zbMATH Keywords

data compressionarithmetic codingchaotic mapencryptionHuffman codingsource coding[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=generalized+L%EF%BF%BD%EF%BF%BDroth+series&go=Go generalized L��roth series]

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24) Source coding (94A29) Stability of topological dynamical systems (37B25) Dynamical systems involving maps of the interval (37E05)

Cites Work

• A Mathematical Theory of Communication
• Title not available (Why is that?)
• Ergodic theory of chaos and strange attractors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Communication Theory of Secrecy Systems*
• Title not available (Why is that?)
• A Method for the Construction of Minimum-Redundancy Codes
• Arithmetic Coding
• Chaos
• Arithmetic coding as a non-linear dynamical system
• SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
• Robust Chaos
• Title not available (Why is that?)
• Cantor's Series for Vectors
• DESIGN OF ONE-DIMENSIONAL CHAOTIC MAPS WITH PRESCRIBED STATISTICAL PROPERTIES
• Probability density functions of some skew tent maps
• On grammars, complexity, and information measures of biological macromolecules
• Piecewise linear maps, Lyapunov exponents and entropy
• Title not available (Why is that?)

Cited In (17)

• Generalized Smooth Transition Map Between Tent and Logistic Maps
• ChaosNet: A chaos based artificial neural network architecture for classification
• An application of the Hopfield model to Huffman codes
• Joint compression and encryption using chaotically mutated Huffman trees
• A novel block-based scheme for arithmetic coding
• Application of Gray codes to the study of the theory of symbolic dynamics of unimodal maps
• When noise meets chaos: stochastic resonance in neurochaos learning
• A dynamical systems proof of Kraft–McMillan inequality and its converse for prefix-free codes
• GENERALIZED ARITHMETIC CODING USING DISCRETE CHAOTIC MAPS
• One-time pad as a nonlinear dynamical system
• Arithmetic coding as a non-linear dynamical system
• An efficient coding system for long source sequences
• A secure and efficient entropy coding based on arithmetic coding
• Comments on ``Arithmetic coding as a non-linear dynamical system
• GLS coding based security solution to JPEG with the structure of aggregated compression and encryption
• Multiplexing of discrete chaotic signals in presence of noise
• The problem of the inverse Lyapunov exponent and its applications

   Recommendations

• Arithmetic coding as a non-linear dynamical system 👍 👎
• Comments on ``Arithmetic coding as a non-linear dynamical system 👍 👎
• Generalized arithmetic coding using discrete chaotic maps 👍 👎
• An efficient coding system for long source sequences 👍 👎
• A secure and efficient entropy coding based on arithmetic coding 👍 👎

This page was built for publication: Arithmetic coding as a non-linear dynamical system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716619)