82,662 research outputs found
Capacity of Sum-networks for Different Message Alphabets
A sum-network is a directed acyclic network in which all terminal nodes
demand the `sum' of the independent information observed at the source nodes.
Many characteristics of the well-studied multiple-unicast network communication
problem also hold for sum-networks due to a known reduction between instances
of these two problems. Our main result is that unlike a multiple unicast
network, the coding capacity of a sum-network is dependent on the message
alphabet. We demonstrate this using a construction procedure and show that the
choice of a message alphabet can reduce the coding capacity of a sum-network
from to close to
On Network Coding Capacity - Matroidal Networks and Network Capacity Regions
One fundamental problem in the field of network coding is to determine the
network coding capacity of networks under various network coding schemes. In
this thesis, we address the problem with two approaches: matroidal networks and
capacity regions.
In our matroidal approach, we prove the converse of the theorem which states
that, if a network is scalar-linearly solvable then it is a matroidal network
associated with a representable matroid over a finite field. As a consequence,
we obtain a correspondence between scalar-linearly solvable networks and
representable matroids over finite fields in the framework of matroidal
networks. We prove a theorem about the scalar-linear solvability of networks
and field characteristics. We provide a method for generating scalar-linearly
solvable networks that are potentially different from the networks that we
already know are scalar-linearly solvable.
In our capacity region approach, we define a multi-dimensional object, called
the network capacity region, associated with networks that is analogous to the
rate regions in information theory. For the network routing capacity region, we
show that the region is a computable rational polytope and provide exact
algorithms and approximation heuristics for computing the region. For the
network linear coding capacity region, we construct a computable rational
polytope, with respect to a given finite field, that inner bounds the linear
coding capacity region and provide exact algorithms and approximation
heuristics for computing the polytope. The exact algorithms and approximation
heuristics we present are not polynomial time schemes and may depend on the
output size.Comment: Master of Engineering Thesis, MIT, September 2010, 70 pages, 10
figure
Neuronal Synchronization Can Control the Energy Efficiency of Inter-Spike Interval Coding
The role of synchronous firing in sensory coding and cognition remains
controversial. While studies, focusing on its mechanistic consequences in
attentional tasks, suggest that synchronization dynamically boosts sensory
processing, others failed to find significant synchronization levels in such
tasks. We attempt to understand both lines of evidence within a coherent
theoretical framework. We conceptualize synchronization as an independent
control parameter to study how the postsynaptic neuron transmits the average
firing activity of a presynaptic population, in the presence of
synchronization. We apply the Berger-Levy theory of energy efficient
information transmission to interpret simulations of a Hodgkin-Huxley-type
postsynaptic neuron model, where we varied the firing rate and synchronization
level in the presynaptic population independently. We find that for a fixed
presynaptic firing rate the simulated postsynaptic interspike interval
distribution depends on the synchronization level and is well-described by a
generalized extreme value distribution. For synchronization levels of 15% to
50%, we find that the optimal distribution of presynaptic firing rate,
maximizing the mutual information per unit cost, is maximized at ~30%
synchronization level. These results suggest that the statistics and energy
efficiency of neuronal communication channels, through which the input rate is
communicated, can be dynamically adapted by the synchronization level.Comment: 47 pages, 14 figures, 2 Table
- …