نتایج جستجو برای: shannons entropy rate

تعداد نتایج: 1019691  

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2005
Zeev Dvir Amir Shpilka

Mergers are functions that transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one of the input sources has min-entropy rate δ then the output has min-entropy rate close to δ. Mergers have proven to be a very useful tool in explicit constructions of extractors and condensers, and are also interesting objects in their own right. In this work...

2011
Morteza Khodabin

In this paper, the two parameter ADK entropy, as a generalized of Re’nyi entropy, is considered and some properties of it, are investigated. We will see that the ADK entropy for continuous random variables is invariant under a location and is not invariant under a scale transformation of the random variable. Furthermore, the joint ADK entropy, conditional ADK entropy, and chain rule of this ent...

Journal: :Entropy 2017
Jerry D. Gibson Preethi Mahadevan

We provide a new derivation of the log likelihood spectral distance measure for signal processing using the logarithm of the ratio of entropy rate powers. Using this interpretation, we show that the log likelihood ratio is equivalent to the difference of two differential entropies, and further that it can be written as the difference of two mutual informations. These latter two expressions allo...

Journal: :Physica A: Statistical Mechanics and its Applications 2016

Journal: :CoRR 2013
Marc Harper

The entropy rates of the Wright-Fisher process, the Moran process, and generalizations are computed and used to compare these processes and their dependence on standard evolutionary parameters. Entropy rates are measures of the variation dependent on both short-run and long-run behavior, and allow the relationships between mutation, selection, and population size to be examined. Bounds for the ...

Journal: :IEEE Trans. Information Theory 2009
Dake He Luis Alfonso Lastras-Montaño En-Hui Yang Ashish Jagmohan Jun Chen

In this paper, the redundancy of both variable and fixed rate Slepian–Wolf coding is considered. Given any jointly memoryless source-side information pair with finite alphabet, the redundancy of variable rate Slepian–Wolf coding of  with decoder only side information depends on both the block length and the decoding block error probability , and is defined as the difference between the minimum...

Journal: :Journal of Thermal Engineering 2019

Journal: :Journal of the Meteorological Society of Japan. Ser. II 1983

Journal: :IEEE Transactions on Information Theory 2006

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید