On block irreducible forms over Euclidean domains.
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.
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.
Aiming at the previously-proposed entropy-based differently implicational algorithm of fuzzy inference, this study analyzes its continuity. To begin with, for the FMP (fuzzy modus ponens) and FMT (fuzzy modus tollens) problems, the continuous as well as uniformly continuous properties of the entropy-based differently implicational algorithm are demonstrated for the Tchebyshev and Hamming metrics, in which the R-implications derived from left-continuous t-norms are employed. Furthermore, four numerical...
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...