Bezpečnostní kódy v železničních zabezpečovacích zařízeních
This article provides entropic inequalities for binomial-Poisson distributions, derived from the two point space. They appear as local inequalities of the M/M/∞ queue. They describe in particular the exponential dissipation of Φ-entropies along this process. This simple queueing process appears as a model of “constant curvature”, and plays for the simple Poisson process the role played by the Ornstein-Uhlenbeck process for Brownian Motion. Some of the inequalities are recovered by semi-group ...
The concept of -divergences was introduced by Csiszár in 1963 as measures of the ‘hardness’ of a testing problem depending on a convex real valued function on the interval . The choice of this parameter can be adjusted so as to match the needs for specific applications. The definition and some of the most basic properties of -divergences are given and the class of -divergences is presented. Ostrowski’s inequality and a Trapezoid inequality are utilized in order to prove bounds for an extension...
In this paper we establish an upper and a lower bound for the -divergence of two discrete random variables under likelihood ratio constraints in terms of the Kullback-Leibler distance. Some particular cases for Hellinger and triangular discimination, -distance and Rényi’s divergences, etc. are also considered.
The hypergeometric distributions have many important applications, but they have not had sufficient attention in information theory. Hypergeometric distributions can be approximated by binomial distributions or Poisson distributions. In this paper we present upper and lower bounds on information divergence. These bounds are important for statistical testing and for a better understanding of the notion of exchangeability.
One of the important parts of railway signalling systems design is the safety of communication, achievable - among others - with the error detecting code. Getting evidence of quantitative safety targets, especially the probability of undetected error of the code, is a surprisingly complicated issue. We've analysed 2048 irreducible self-adjoint generator polynomials of the degree 32. More than 70 of these have a maximum probability of failure lower than the standard codes generally used. In this...
Entropy maximization subject to known expected values is extended to the case where the random variables involved may take on positive infinite values. As a result, an arbitrary probability distribution on a finite set may be realized as a canonical distribution. The Rényi entropy of the distribution arises as a natural by-product of this realization. Starting with the uniform distributionon a proper subset of a set, the canonical distribution of equilibriumstatistical mechanics may be used to exhibit...
We study two systems that are based on sums of weakly dependent Bernoulli random variables that take values ± 1 with equal probabilities. We show that already one step of the so-called soft decision parallel interference cancellation, used in the third generation of mobile telecommunication CDMA, is able to considerably increase the number of users such a system can host. We also consider a variant of the well-known Hopfield model of neural networks. We show that this variant proposed by Amari...