#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2002

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Elona Erez, Meir Feder
- 2005

Most data networks contain cycles, but so far most attention in the literature of network coding has been addressed to multicast in acyclic networks. The original paper on network coding [1] did consider cyclic networks but there it was suggested to transform the cyclic network into an acyclic network using the idea of unrolling the network into a layered… (More)

- Elona Erez, Yun Xu, Edmund M. Yeh
- 2010 48th Annual Allerton Conference on…
- 2010

The capacity of multiuser networks has been a long-standing problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to approximate wireless networks. For multicast, they have shown that the capacity for the deterministic model is equal to the minimal rank of the incidence matrix of a certain cut between the… (More)

- Elona Erez, Meir Feder
- IEEE Journal on Selected Areas in Communications
- 2009

- Elona Erez, Meir Feder
- IEEE Transactions on Information Theory
- 2010

This paper introduces an efficient polynomial-time code construction algorithm for cyclic networks, which achieves the optimal multicast rate. Until this work, no explicit capacity-achieving polynomial-time code construction for <i>cyclic</i> networks has been known. This new construction algorithm has the additional advantage that as sinks are added or… (More)

In this paper we derive capacity regions for network error correction with both known and unknown topologies (coherent and non-coherent network coding) under a multiplesource multicast transmission scenario. For the multiple-source non-multicast scenario, given any achievable network code for the error-free case, we construct a code with a reduced rate… (More)

- Svitlana Vyetrenko, Tracey Ho, Elona Erez
- 2009 IEEE International Symposium on Information…
- 2009

We consider the problem of correcting errors and erasures with network coding. Unlike existing works which consider performance limits for worst-case locations of given numbers of errors and erasures, we consider the performance of given (not necessarily optimal) coding and forwarding strategies for given (not necessarily worst-case) models of error and… (More)

We present a new approach to network coding problems that could lead to a systematic method for deciding solvability of a given network. The approach is based on a graph theoretic formulation of the problem. The constraints at each node in the network are represented using hyperedges in a ‘conflict’ hypergraph. This representation reduces the solvability… (More)

- MinJi Kim, Elona Erez, Edmund M. Yeh, Muriel Médard
- IEEE Transactions on Information Theory
- 2014

The capacity of multiuser networks has been a long-standing problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to approximate multiuser wireless networks. This model, known as the ADT network model, takes into account the broadcast nature as well as the multiuser interference inherent in the wireless… (More)

- Elona Erez, Meir Feder
- IEEE Trans. Information Theory
- 2003

- Elona Erez, Meir Feder
- 2007

Most literature on network coding focuses on the multicast case where performance bounds and codes that achieve these bounds were found. The general case seems to be much more complicated to analyze. Koetter and Médard [1] gave an algebraic formulation of linear network codes in the general communication problem with multiple sources. However, the… (More)