On Certain Approaches for Analysis and Design of Cryptographic Techniques
On characterization of directed divergence of type through information equation
On characterization of useful information-theoretic measures
On cheating immune secret sharing.
On codes having no finite completion
On codes with finite interpreting delay : a defect theorem
On codes with finite interpreting delay: a defect theorem
We introduce two new classes of codes, namely adjacent codes and codes with finite interpreting delay. For each class, we establish an extension of the defect theorem.
On coding theorem connected with “useful” entropy of order-.
On dimensions of semimetrized measure spaces
On discrete channels decomposable into memoryless components
On discrete Fourier analysis of amplitude and phase modulated signals
In this work the problem of characterization of the Discrete Fourier Transform (DFT) spectrum of an original complex-valued signal , t=0,1,...,n-1, modulated by random fluctuations of its amplitude and/or phase is investigated. It is assumed that the amplitude and/or phase of the signal at discrete times of observation are distorted by realizations of uncorrelated random variables or randomly permuted sequences of complex numbers. We derive the expected values and bounds on the variances of such...
On dispersion measures.
In this paper a new framework for the study of measures of dispersion for a class of n-dimensional lists is proposed. The concept of monotonicity with respect to a sharpened-type order is introduced. This type of monotonicity, together with other well known conditions, allows to create a reasonable and general ambit where the notion of dispersion measure can be studied. Some properties are analized and relations with other approaches carried out by different authors on this subject are established....
On Distributed Oblivious Transfer
The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakaloff , Sofia, July, 2006. The material in this paper was presented in part at INDOCRYPT 2002This paper is about unconditionally secure distributed protocols for oblivious transfer, as proposed by Naor and Pinkas and generalized by Blundo et al. In this setting a Sender has ζ secrets and a Receiver is interested in one of them. The Sender distributes the...
On distribution functions of sequences generated by scalar and mixed product
On entropies for random partitions of the unit segment
We prove the complete convergence of Shannon’s, paired, genetic and α-entropy for random partitions of the unit segment. We also derive exact expressions for expectations and variances of the above entropies using special functions.
On entropy-like functionals and codes for metrized probability spaces. I.
On entropy-like functionals and codes for metrized probability spaces II
In Part I, we have proved characterization theorems for entropy-like functionals , , , and restricted to the class consisting of all finite spaces , the class of all semimetric spaces equipped with a bounded measure. These theorems are now extended to the case of , and defined on the whole of , and of and restricted to a certain fairly wide subclass of .
On equivalence of two tests for codes.
On extended Shannon entropies and the epsilon entropy
On Fisher information inequalities and score functions in non-invertible linear systems.