In information theory, Rényi entropy, an extension of Shannon entropy, is a means of quantifying the entropy of a system. Entropy characterizes the disorder of the system, how much information can be compressed and consequently how much information is present in a signal or system (see Information entropy). Rényi entropy is defined as
where pi are probabilities and
. As α approaches 1, Hα converges to Shannon entropy. For some α and α' where
, Rényi entropy guarantees that
.