On Shannon-McMillan's limit theorem for pairs of stationary random processes
On the capacity of asymptotically mean stationary channels
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 typical encodings of multivariate ergodic sources
We show that the typical coordinate-wise encoding of multivariate ergodic source into prescribed alphabets has the entropy profile close to the convolution of the entropy profile of the source and the modular polymatroid that is determined by the cardinalities of the output alphabets. We show that the proportion of the exceptional encodings that are not close to the convolution goes to zero doubly exponentially. The result holds for a class of multivariate sources that satisfy asymptotic equipartition...
Pseudo-generalization of Shannon inequality for Mittal's entropy and its application in coding theory
Restitution des coefficients d'ondelettes des signaux filtrés
Signatura of magic and Latin integer squares: isentropic clans and indexing
The 2010 study of the Shannon entropy of order nine Sudoku and Latin square matrices by Newton and DeSalvo [Proc. Roy. Soc. A 2010] is extended to natural magic and Latin squares up to order nine. We demonstrate that decimal and integer measures of the Singular Value sets, here named SV clans, are a powerful way of comparing different integer squares. Several complete sets of magic and Latin squares are included, including the order eight Franklin subset which is of direct relevance...
Simultaneous channels decomposable into memoryless components. I
Simultaneous channels decomposable into memoryless components. II
Some noiseless coding theorem connected with Havrda and Charvat and Tsallis's entropy
Some results on a generalized useful information measure.
Statistical tests of optimality of source codes
Stochastic signal codification and sigma transform.
In the last years, a relation between bounded real functions of one variable and two-valued probabilistic functions defined on the complex plane has been established through the introduction of the Sigma-Transform concept.The paper presents an extension of the concept of Sigma-Transform, giving rise to the diagonal Sigma-Transform and the Striped Sigma-Transform which, when combined, allow a formal treatment of the Multichannel Stochastic Signal Codification. An application of the method to error...
Tropical probability theory and an application to the entropic cone
In a series of articles, we have been developing a theory of tropical diagrams of probability spaces, expecting it to be useful for information optimization problems in information theory and artificial intelligence. In this article, we give a summary of our work so far and apply the theory to derive a dimension-reduction statement about the shape of the entropic cone.
Universally typical sets for ergodic sources of multidimensional data
We lift important results about universally typical sets, typically sampled sets, and empirical entropy estimation in the theory of samplings of discrete ergodic information sources from the usual one-dimensional discrete-time setting to a multidimensional lattice setting. We use techniques of packings and coverings with multidimensional windows to construct sequences of multidimensional array sets which in the limit build the generated samples of any ergodic source of entropy rate below an with...
О свободных подалгебрах свободных ассоциативных алгебр.