Sciweavers

2499 search results - page 68 / 500
» The Serializability of Network Codes
Sort
View
IPSN
2005
Springer
15 years 3 months ago
Lossy network correlated data gathering with high-resolution coding
— We consider a sensor network measuring correlated data, where the task is to gather all data from the network nodes to a sink. We consider the case where data at nodes is lossy...
Razvan Cristescu, Baltasar Beferull-Lozano
DCOSS
2008
Springer
14 years 11 months ago
Decoding Code on a Sensor Node
Abstract. Wireless sensor networks come of age and start moving out of the laboratory into the field. As the number of deployments is increasing the need for an efficient and relia...
Pascal von Rickenbach, Roger Wattenhofer
MOBIHOC
2012
ACM
13 years 9 days ago
Throughput of rateless codes over broadcast erasure channels
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
Yang Yang, Ness B. Shroff
BIOSYSTEMS
2007
123views more  BIOSYSTEMS 2007»
14 years 10 months ago
Real time computation: Zooming in on population codes
Information processing in nervous systems intricately combines computation at the neuronal and network levels. Many computations may be envisioned as sequences of signal processin...
Olivier Rochel, Netta Cohen
JNSM
2006
78views more  JNSM 2006»
14 years 9 months ago
Edge-Cut Bounds on Network Coding Rates
Two bounds on network coding rates are reviewed that generalize edge-cut bounds on routing rates. The simpler bound is a bidirected cut-set bound which generalizes and improves upo...
Gerhard Kramer, Serap A. Savari