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.
We treat the problem of bounding components of the possible distance distributions of codes given the knowledge of their size and, perhaps, minimum distance.
We consider the problem of minimizing the amount of deployed fiber in optical networks in which each fiber carries a fixed number of wavelengths.
Iterated localization is considered where each node of a network needs to get localized (find its location on 2D plane), when initially only a subset of nodes have their location information.
