On the capacity of asymptotically mean stationary channels
On the coding theorem for decomposable discrete information channels. I
On the coding theorem for decomposable discrete information channels. II
On the computation of covert channel capacity
We address the problem of computing the capacity of a covert channel, modeled as a nondeterministic transducer. We give three possible statements of the notion of “covert channel capacity” and relate the different definitions. We then provide several methods allowing the computation of lower and upper bounds for the capacity of a channel. We show that, in some cases, including the case of input-deterministic channels, the capacity of the channel can be computed exactly (e.g. in the form...
On the connection between the theory of signal flow graphs and the theory of directed graphs
On the degree of finite maximal biprefix codes.
On the detection of a complex finite binary sequence in the presence of an interfering complex binary sequence
On the diameter of matroid ports.
On the differential and residual entropy
On the distribution of the elliptic subset sum generator of pseudorandom numbers.
On the Entropy and Inaccuracy of Similarly and Oppositely Ordered Discrete Probability Distributions (I).
On the error exponent for ergodic Markov source
On the evaluation of properties of the sequential probability ratio test for statistically dependent observations
On the existence of finite generators for invertible measure-preserving transformations
On the -entropy and its Hudetz correction
The Hudetz correction of the fuzzy entropy is applied to the -entropy. The new invariant is expressed by the Hudetz correction of fuzzy entropy.
On the general solution of a functional equation connected to sum form information measures on open domain. III.
On the identification of a subclass of finite state channels and their capacity
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...