On a detection method for known finite sequences
On a tree collision resolution algorithm in presence of capture
On broadcast channels with side information under fidelity criteria
On discrete channels decomposable into memoryless components
On recursive filters inverse to finite sequences in the minimum mean square sense
On Schur-convexity of expectation of weighted sum of random variables with applications.
On spectral bandwidth of a stationary random process
The irregularity coefficient is one of the numerical characteristics of the spectral bandwith of a stationary random process. Its basic properties are investigated and the application to the dichotomic classification of a process into narrow-band and wide-band ones is given. Further, its behaviour is analyzed for sufficiently wide classes of stationary processes whose spectral densities frequently appear both in theory and applications.
On the connection between the theory of signal flow graphs and the theory of directed graphs
On the evaluation of properties of the sequential probability ratio test for statistically dependent observations
On the optimum decision rule for the radar signal processing
On the physical and communication properties of a thermodynamical communication channel
On the pseudoinverse of a sum of symmetric matrices with applications to estimation
On the regularity condition for decomposable communication channels
On two special cases of the optimum decision rule for the radar signal processing
One-way communication complexity of symmetric boolean functions
We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction needs maximum complexity. Moreover, in order to obtain an optimal protocol, it is in any case sufficient...
One-way communication complexity of symmetric Boolean functions
We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction needs maximum complexity. Moreover, in order to obtain an optimal protocol, it is in any case sufficient...
Optimal discrete signal representation by the system of discrete orthonormal exponentials in conjugate pairs of exponents