Some observations on the cryptographic hash functions.
Some properties of -frames of subspaces.
Some remarks on entropic distance, entropic measure of connexion and Hamming distance
Some results concerning maximum Rényi entropy distributions
Some results on a generalized useful information measure.
Some stationary source and joint source-channel coding theorems with a fidelity criterion
Some theorems on geometric measure of distortion
Sous-monoides et codes avec des mots infinis.
Special Functions and Pathways for Problems in Astrophysics: An Essay in Honor of A.M. Mathai
The paper provides a review of A.M. Mathai's applications of the theory of special functions, particularly generalized hypergeometric functions, to problems in stellar physics and formation of structure in the Universe and to questions related to reaction, diffusion, and reaction-diffusion models. The essay also highlights Mathai's recent work on entropic, distributional, and differential pathways to basic concepts in statistical mechanics, making use of his earlier research results in information...
Special issue on decentralized control of large scale complex systems
This special issue provides information on current and future research directions in the emerging field of Decentralized Control of Large Scale Complex Systems. There is generally adopted view that a dynamic system is large scale complex whenever it is necessary to partition its analysis or synthesis problem to manageable subproblems. Its fundamental characteristics in modeling and control are high dimensionality, uncertainty, information structure constraints, and delays. Theory of large scale...
Spectrum of Signals.
Spectrum-oriented source coding theory
Spline Subdivision Schemes for Compact Sets. A Survey
Dedicated to the memory of our colleague Vasil Popov January 14, 1942 – May 31, 1990 * Partially supported by ISF-Center of Excellence, and by The Hermann Minkowski Center for Geometry at Tel Aviv University, IsraelAttempts at extending spline subdivision schemes to operate on compact sets are reviewed. The aim is to develop a procedure for approximating a set-valued function with compact images from a finite set of its samples. This is motivated by the problem of reconstructing a 3D object from...
Spontaneous clustering in theoretical and some empirical stationary processes*
In a stationary ergodic process, clustering is defined as the tendency of events to appear in series of increased frequency separated by longer breaks. Such behavior, contradicting the theoretical “unbiased behavior” with exponential distribution of the gaps between appearances, is commonly observed in experimental processes and often difficult to explain. In the last section we relate one such empirical example of clustering, in the area of marine technology. In the theoretical part of the paper...
Stability and throughput improvement for multichannel CSMA and CSMA/CD protocols with optimal bandwidth allocation
This paper examines appropriate protocols for high speed multiple access communication systems where the bandwidth is divided into two separate asymmetric channels. Both channels operate using slotted non-persistent CSMA or CSMA/CD techniques. Free stations access the first channel while all retransmissions occur in the second channel. We define the stability regions and the rules for optimal bandwidth allocation among the two channels for improvement of the system performance in case of infinite...
Stability type results concerning the fundamental equation of information of multiplicative type
The paper deals with the stability of the fundamental equation of information of multiplicative type. It is proved that the equation in question is stable in the sense of Hyers and Ulam under some assumptions. This result is applied to prove the stability of a system of functional equations that characterizes the recursive measures of information of multiplicative type.
Statistical data reduction via construction of sample space partitions
Statistical manifolds with maximal automorphisms group.
Statistical properties of Markov dynamical sources: applications to information theory.
Statistical tests of optimality of source codes