#### Filter Results:

- Full text PDF available (188)

#### Publication Year

1993

2017

- This year (4)
- Last 5 years (43)
- Last 10 years (117)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Tracey Ho, Muriel Médard, +4 authors Ben Leong
- IEEE Transactions on Information Theory
- 2006

We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. We show that this achieves capacity with probability exponentially approaching 1 with the code… (More)

- Sidharth Jaggi, Peter Sanders, +4 authors Ludo M. G. M. Tolhuizen
- IEEE Transactions on Information Theory
- 2005

The famous max-flow min-cut theorem states that a source node s can send information through a network (V, E) to a sink node t at a rate determined by the min-cut separating s and t. Recently, it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediate nodes are allowed to re-encode the information… (More)

We present a novel randomized network coding approach for robust, distributed transmission and compression of information in networks, and demonstrate its advantages over routing-based

- Amir F. Dana, Radhika Gowaikar, R. Palanki, Babak Hassibi, Michelle Effros
- IEEE Transactions on Information Theory
- 2006

In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring each node to send the same signal on all outgoing channels.… (More)

We consider a randomized network coding approach for multicasting from several sources over a network, in which nodes independently and randomly select linear mappings from inputs onto output links over some field. This approach was first described in [3], which gave, for acyclic delay-free networks, a bound on error probability, in terms of the number of… (More)

- Sidharth Jaggi, Michael Langberg, +4 authors Michelle Effros
- IEEE Transactions on Information Theory
- 2007

Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information reaching a destination, preventing decoding. This paper introduces distributed polynomial-time rate-optimal network codes that work in… (More)

- Minkyu Kim, Muriel Médard, +4 authors Michelle Effros
- IEEE INFOCOM 2007 - 26th IEEE International…
- 2007

We wish to minimize the resources used for network coding while achieving the desired throughput in a multicast scenario. We employ evolutionary approaches, based on a genetic algorithm, that avoid the computational complexity that makes the problem NP-hard. Our experiments show great improvements over the sub-optimal solutions of prior methods. Our new… (More)

Abstract— We consider the problem of minimizing the resources used for network coding while achieving the desired throughput in a multicast scenario. Since this problem is NPhard, we seek a method for quickly finding sufficiently good solutions. To this end, we take an evolutionary approach based on a genetic algorithm that works in an algebraic framework,… (More)

We consider the ability of a distributed randomized network coding approach to multicast, to one or more receivers, correlated sources over a network where compression may be required. We give, for two arbitrarily correlated sources in a general network, upper bounds on the probability of decoding error at each receiver, in terms of network parameters. In… (More)

We consider the issue of coding for non-multicast networks. For multicast networks, it is known that linear operations over a field no larger than the number of receivers are sufficient to achieve all feasible connections. In the case of nonmulticast networks, necessary and sufficient conditions are known, if we restrict ourselves to linear codes over a… (More)