An improvement of the upper bound on the entropy of information sources
Yamin Sayyari
Abstract
Yamin Sayyari
Abstract
Theory of zeta functions and fractional calculus plays an important role in the statistical problems and Shannon's entropy. Estimation of Shannon's entropies of information sources from numerical simulation of long orbits is difficult. Our aim within this paper is to present a strong upper bound for the Shannon's entropy of information sources.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Theory of zeta functions and fractional calculus plays an important role in the statistical problems and Shannon's entropy. Estimation of Shannon's entropies of information sources from numerical simulation of long orbits is difficult. Our aim within this paper is to present a strong upper bound for the Shannon's entropy of information sources.
Key concepts: Mathematics, Shannon's source coding theorem, Information theory, Upper and lower bounds, Entropy (arrow of time), Rényi entropy, Min entropy, Applied mathematics