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
Performance analysis of IEEE 802.11 DCF under nonsaturation condition.
Performance of multichannel multiaccess protocols with receiver collisions
Příspěvek k problému validizace
Secure communications based on discrete time chaotic systems
Shannon's sampling theorem, incongruent residue classes and Plancherel's theorem
Sampling theory for multi-band signals is shown to have a logical structure similar to that of Fourier analysis.
Signal and noise in nonlinear devices
Stochastic domination for iterated convolutions and catalytic majorization
We study how iterated convolutions of probability measures compare under stochastic domination. We give necessary and sufficient conditions for the existence of an integer n such that μ*n is stochastically dominated by ν*n for two given probability measures μ and ν. As a consequence we obtain a similar theorem on the majorization order for vectors in Rd. In particular we prove results about catalysis in quantum information theory.
Study of a least-squares-based algorithm for autoregressive signals subject to white noise.
Summarizing sensors data in vehicular ad hoc networks
This article focuses on data aggregation in vehicular ad hoc networks. In such networks, sensor data are usually produced and exchanged between vehicles in order to warn or inform the drivers when an event is detected (e.g., accident, emergency braking, parking space released, vehicle with non-functioning brake lights, etc.). In the following, we present a solution to aggregate and store these data in order to have a history of past events. We therefore use Flajolet-Martin sketches. Our goal is...
Summarizing sensors data in vehicular ad hoc networks
This article focuses on data aggregation in vehicular ad hoc networks. In such networks, sensor data are usually produced and exchanged between vehicles in order to warn or inform the drivers when an event is detected (e.g., accident, emergency braking, parking space released, vehicle with non-functioning brake lights, etc.). In the following, we present a solution to aggregate and store these data in order to have a history of past events. We therefore use Flajolet-Martin sketches. Our goal is...
Two open problems in communication in edge-disjoint paths modes
Variable rate multi-channel (Papoulis) sampling expansion (via sub-channel analysis)
Vergleich der unterschiedlichen Gütemaße zur Bewertung von Auto- und Kreuzkorrelationsfunktionen
Verschlüsselungsabbildungen mit Pseudo-Inversen, Zufallsgeneratoren und Täfelungen
К вопросу об оптимальной фильтрации и экстраполяции радиолокационного сигнала с неполными данными