Constructing the optimal convolutional codes by analytic methods has been an open problem.
Writing fault-tolerant programs in distributed systems is a delicate task. It is relatively difficult for message passing systems than for shared memory systems.
We create variable-length pseudorandompermutations (PRPs) and strong PRPs (SPRPs) accepting inputs of any length in the range of b to 2b bits from fixed-length, b-bit PRPs.We utilize the elastic ne
We have used identified neurons from the molluse Aplysia to construct novel circuits in vitro.
This memorandum describes the design, construction and calibration of a computer controlled probe for measuring the contact resistance of test coupons.
An s -stage (connecting) network satisfies the following conditions: (i) The network is composed of switches and links. Switches are arranged in a sequence of s stages.
A two-dimensional version of the sampling theorem, first discussed by Bracewell in 1962, is cast in a form which can be implemented as a computer program.
We construct a wave function, generalizing the well-known Moore-Read Pfaffian, that describes spinless electrons at filling fraction nu=2/5 (or bosons at filling fraction nu=2/3) as the ground stat
In this paper, we present a method to construct the girth-6 protographs that lead to the shortest constraint length in the convolutional structure.
Radio environment map (REM) which is a geological map with overlay of performance information of a radio communication can be considered as one of the key enablers of the selforganizing networks (S
