One of Shannon's intuitive schemes for estimating the Entropy of printed English is generalized here to discrete parameter, discrete range random fields. An application to a visual source is also presented to illustrate the generalization
Since the entropy is a popular randomness measure, there are many studies for the estimation of entr...
Random numbers are essential for cryptography. In most real-world systems, these values come from a...
The problem addressed concerns the determination of the average number of successive attempts of g...
One of Shannon's intuitive schemes for estimating the Entropy of printed English is generalized here...
The goal of this paper is to show the dependency of the entropy of English text on the subject of th...
This paper describes the method which allows an estimation of information entropy in the meaning of ...
This work is a discussion of algorithms for estimating the Shannon entropy h of finite symbol sequen...
An expression for the entropy of a random variable whose probability density function is reported as...
Given a probability space, we analyze the uncertainty, that is, the amount of information of a finit...
Many computer applications use random numbers as an important computational resource, and they often...
Approximate Entropy and Sample Entropy are two algorithms for determining the regularity of series o...
Shannon's famous paper [1] paved the way to a theory called information theory. In essence, the...
Shannon entropy is often considered as a measure of uncertainty. It is commonly believed that entro...
The concept of entropy rate is well defined in dynamical systems theory but is impossible to apply i...
We give a survey of the basic statistical ideas underlying the definition of entropy in information...
Since the entropy is a popular randomness measure, there are many studies for the estimation of entr...
Random numbers are essential for cryptography. In most real-world systems, these values come from a...
The problem addressed concerns the determination of the average number of successive attempts of g...
One of Shannon's intuitive schemes for estimating the Entropy of printed English is generalized here...
The goal of this paper is to show the dependency of the entropy of English text on the subject of th...
This paper describes the method which allows an estimation of information entropy in the meaning of ...
This work is a discussion of algorithms for estimating the Shannon entropy h of finite symbol sequen...
An expression for the entropy of a random variable whose probability density function is reported as...
Given a probability space, we analyze the uncertainty, that is, the amount of information of a finit...
Many computer applications use random numbers as an important computational resource, and they often...
Approximate Entropy and Sample Entropy are two algorithms for determining the regularity of series o...
Shannon's famous paper [1] paved the way to a theory called information theory. In essence, the...
Shannon entropy is often considered as a measure of uncertainty. It is commonly believed that entro...
The concept of entropy rate is well defined in dynamical systems theory but is impossible to apply i...
We give a survey of the basic statistical ideas underlying the definition of entropy in information...
Since the entropy is a popular randomness measure, there are many studies for the estimation of entr...
Random numbers are essential for cryptography. In most real-world systems, these values come from a...
The problem addressed concerns the determination of the average number of successive attempts of g...
DOI
Add to ORKG