On an evaluation function for heuristic search as a path problem
On another two cryptographic identities in universal Osborn loops.
On asymptotic stability of passive linear electrical networks
On axiomatic characterization of entropy of type
On axiomatic characterization of information-theoretic measure type
On Axiomatic Characterization of Some Non-Additive Measures of Information.
On bandlimited signals with minimal product of effective spatial and spectral widths.
On bilinear forms based on the resolvent of large random matrices
Consider a non-centered matrix with a separable variance profile: Matrices and are non-negative deterministic diagonal, while matrix is deterministic, and is a random matrix with complex independent and identically distributed random variables, each with mean zero and variance one. Denote by the resolvent associated to , i.e. Given two sequences of deterministic vectors and with bounded Euclidean norms, we study the limiting behavior of the random bilinear form: as the dimensions...
On block irreducible forms over Euclidean domains.
On Boolean partial differential equations
On broadcast channels with side information under fidelity criteria
On capacity regions of discrete asynchronous multiple access channels
A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. The main result is the single letter characterization of the capacity region in case of 3 senders, 2 synchronous with each other and the third not synchronous with them.
On Certain Approaches for Analysis and Design of Cryptographic Techniques
On certain codes admitting inverse semigroups as syntactic monoids.
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.