Skip to search formSkip to main contentSkip to account menu

Chernoff bound

Known as: Chernoff, Chernoff's inequality, Chernoff inequality 
In probability theory, the Chernoff bound, named after Herman Chernoff but due to Herman Rubin, gives exponentially decreasing bounds on tail… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Statistical analysis of attacks on block ciphers have mostly used normal approximations. A few recent works have proposed doing… 
2012
2012
The vulnerability of cryptographic devices to side-channel attacks is of interest in the domain of information security. The… 
2012
2012
In this short note we will present two stability properties of the Chernoff-Ou-Pan inequality, newly obtained in [6], which… 
2004
2004
An analytical formulation of the outage probability in terms of bit error rate specification for variable bit rate (VBR… 
2003
2003
Concepts of metadata visualization have been developed in order to help users in understanding of metadata about geographic… 
2000
2000
This thesis is a sustained meditation on the relationship between embodiment, memory and cultural creativity in the black… 
1997
1997
Controlled intersymbol interference may be used to design bandwidth efficient coded modulation schemes. The performance of the… 
1990
1990
A comparison is made of two methods for the computation of the probability that the sum of a Gaussian and a nonGaussian random… 
1980
1980
The classical Shannon-McMillan's fundamental limit theorem concerns the asymptotic behaviour of the probability of n-letter…