Shared registers are basic objects used as communication mediums in asynchronous concurrent computation.
The problems of Interval Sandwich (IS)and Intervalizing Colored Graphs' (ICG) have received a lot of attention recently, due to their applicability to DNA physical mapping problems with ambiguous d
We analyze the ultimate performance limits of inter-cell coordination in a cellular downlink net-work operating under per base power constraints.
In recent years there has been increased interest in t h e s t u d y of the potential a d v a n t a g e s afforded by t h e use of a c o m p u t e r with m a n y processors in parallel.
A lattice polytope is a polytope in R sup n whose vertices are all in Z sup n.
A transistor circuit consisting of linear positive resistors, q exponential diodes, and p Ebers-Moll modeled bipolar transistors has at most (d + 1)(d)2(d(d-1)/2) isolated dc operating points where
In communication theory, it is convenient to deal with bandlimited signals obtained by convolving an arbitrary bounded function with a filter kernel k(t;alpha, beta) whose Fourier transform is 1 ov
In comparing the performance of communication systems t h a t transmit information by means of signals of limited bandwidth, six quantities descriptive of the system and its environment are of part
Building on results from algebraic graph theory and the Erds- Ko-Rado like theorems in extremal combinatorics, we show how several known bounds on codes can be easily obtained in a single framework
The theoretical capabilities of a "polyphase" coding-modulation scheme with additive white Gaussian noise are studied.
