The analogy between coding theory and multifractals

DOI10.1088/0305-4470/31/26/006MaRDI QIDQ3836036zbMATH OpenOpenAlexFDO

Authors Bernard H. Lavenda

Publication date 6 December 1999

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/0305-4470/31/26/006

zbMATH Keywords

asymptotic distributionsattractorscoding theoremminimum lengthRényi entropyvolume

Mathematics Subject Classification ID

Fractals (28A80) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Measures of information, entropy (94A17) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Some coding theorem on generalized Havrda-Charvat and Tsallis's entropy
• Coding theorems on a non-additive generalized entropy of Havrda-Charvat and Tsallis
• Some coding theorem connected on generalized Renyi's entropy for incomplete power probability distribution \(p^\beta\)
• scientific article; zbMATH DE number 3930883
• On a generalized entropy and a coding theorem

Cited in

(1)

• Aspects concerning entropy and utility

This page was built for publication: The analogy between coding theory and multifractals

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