Sciweavers

104 search results - page 4 / 21
» On Field Size and Success Probability in Network Coding
Sort
View
BMCBI
2008
153views more  BMCBI 2008»
13 years 5 months ago
Estimating the size of the solution space of metabolic networks
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...
Alfredo Braunstein, Roberto Mulet, Andrea Pagnani
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 8 days ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
CDC
2009
IEEE
117views Control Systems» more  CDC 2009»
13 years 10 months ago
Information dissemination in networks via linear iterative strategies over finite fields
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
Shreyas Sundaram, Christoforos N. Hadjicostis
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 5 months ago
Symmetric Allocations for Distributed Storage
We consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of s...
Derek Leong, Alexandros G. Dimakis, Tracey Ho
INFOCOM
2009
IEEE
13 years 12 months ago
Forward Correction and Fountain codes in Delay Tolerant Networks
Abstract—Delay tolerant Ad-hoc Networks leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are...
Eitan Altman, Francesco De Pellegrini