On the identification of vertices using cycles.
On the Inequality ... .
On the Inequality ...pi f(pi) > piif(qi).
On the invertibility of finite linear transducers
Linear finite transducers underlie a series of schemes for Public Key Cryptography (PKC) proposed in the 90s of the last century. The uninspiring and arid language then used, condemned these works to oblivion. Although some of these schemes were afterwards shown to be insecure, the promise of a new system of PKC relying on different complexity assumptions is still quite exciting. The algorithms there used depend heavily on the results of invertibility of linear transducers. In this paper we introduce...
On the Jensen-Shannon divergence and the variation distance for categorical probability distributions
We establish a decomposition of the Jensen-Shannon divergence into a linear combination of a scaled Jeffreys' divergence and a reversed Jensen-Shannon divergence. Upper and lower bounds for the Jensen-Shannon divergence are then found in terms of the squared (total) variation distance. The derivations rely upon the Pinsker inequality and the reverse Pinsker inequality. We use these bounds to prove the asymptotic equivalence of the maximum likelihood estimate and minimum Jensen-Shannon divergence...
On the joint 2-adic complexity of binary multisequences
Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with pn-period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences with given joint 2-adic complexity.
On the joint 2-adic complexity of binary multisequences∗
Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with pn-period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences...
On the jump set of solutions of the total variation flow
On the Largest Solution of a Functional Equation Connected to sum Form Information Measures on Open Domain-i
On the mean and the variance of estimates of Kullback information and relative “useful” information measures
In this paper the mean and the variance of the Maximum Likelihood Estimator (MLE) of Kullback information measure and measure of relative "useful" information are obtained.
On the minimum distance of ideals in group algebras
On the modified entropy equation.
On the most weight vectors in a dimension binary code.
On the Multiresolution analysis of abstract Hilbert spaces
On the Non-Existence of Certain M.D.S. Codes and Projective Planes.
On the number of monotonic functions from two-valued logic to -valued logic
On the number of zero trace elements in polynomial bases for F2n.
Let Fq denote the finite field of q elements. O. Ahmadi and A. Menezes have recently considered the question about the possible number of elements with zero trace in polynomial bases of F2n over F2. Here we show that the Weil bound implies that there is such a basis with n + O(log n) zero-trace elements.
On the optimality of a new class of 2D recursive filters
The purpose of this paper is to prove the minimum variance property of a new class of 2D, recursive, finite-dimensional filters. The filtering algorithms are derived from general basic assumptions underlying the stochastic modelling of an image as a 2D gaussian random field. An appealing feature of the proposed algorithms is that the image pixels are estimated one at a time; this makes it possible to save computation time and memory requirement with respect to the filtering procedures based on strip...
On the optimum decision rule for the radar signal processing
On the physical and communication properties of a thermodynamical communication channel