∈-entropy of sets of probability distribution functions and their Fourier-Stieltjes transforms
Entropy of -sums and -products of - fuzzy numbers
In the paper the entropy of – fuzzy numbers is studied. It is shown that for a given norm function, the computation of the entropy of – fuzzy numbers reduces to using a simple formula which depends only on the spreads and shape functions of incoming numbers. In detail the entropy of –sums and –products of – fuzzy numbers is investigated. It is shown that the resulting entropy can be computed only by means of the entropy of incoming fuzzy numbers or by means of their parameters without the...
Entropy of Type (a, ß) and Other Generalized Measures in Information Theory.
Entropy-like functionals: conceptual background and some results
We describe a conceptual approach which provides a unified view of various entropy-like functionals on the class of semimetric spaces, endowed with a bounded measure. The entropy considered in the author’s previous articles is modified so as to assume finite values for a fairly wide class of spaces which fail to be totally bounded.
Enumeration of binary trees and universal types.
Epsilon-rates, epsilon-quantiles, and group coding theorems for finitely additive information sources
Equivalences between elliptic curves and real quadratic congruence function fields
In 1994, the well-known Diffie-Hellman key exchange protocol was for the first time implemented in a non-group based setting. Here, the underlying key space was the set of reduced principal ideals of a real quadratic number field. This set does not possess a group structure, but instead exhibits a so-called infrastructure. More recently, the scheme was extended to real quadratic congruence function fields, whose set of reduced principal ideals has a similar infrastructure. As always, the security...
Ergodic behavior of graph entropy.
Ergodic decomposition of entropy
Ergodic theory, entropy, and coding problems of information theory
Ergodicity and extremality of AMS sources and channels.
Errata to my paper "On some functional equations and their applications".
Error estimates for finite volume scheme for Perona--Malik equation.
Error estimates from noise samples for iterative algorithm in shift-invariant signal spaces.
Es gibt keinen optimalen (n + 2,3)-Code einer ungeraden Ordnung n.
Essential Arity Gap of Boolean Functions
In this paper we investigate the Boolean functions with maximum essential arity gap. Additionally we propose a simpler proof of an important theorem proved by M. Couceiro and E. Lehtonen in [3]. They use Zhegalkin’s polynomials as normal forms for Boolean functions and describe the functions with essential arity gap equals 2. We use to instead Full Conjunctive Normal Forms of these polynomials which allows us to simplify the proofs and to obtain several combinatorial results concerning the Boolean functions...
Estimates of topological entropy of continuous maps with applications.
Estimating the angles of arrival of multiple plane waves. The statistical performance of the music and the minimum norm algorithms
Estimation of channel holding time distribution in cellular telephone systems.
Estimation of probabilistic noise models based on filtration of sample noise sequences