#### Filter Results:

#### Publication Year

2002

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Elona Erez, Meir Feder
- 2005

In this work we address the problem of network codes for cyclic networks. We show that network codes can be constructed for cyclic networks as long as at least one edge in each cycle has a delay, but it is not required that every edge would have a delay. We then present the algorithm for constructing an optimal multicast network code, developed in our… (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)

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)

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)

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)

—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 multiple-source 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)

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 investigate the effect of decoding deadlines on network coding capacity, specifically, the capacity curve of a network as a function of the allowed delay from the time a set of bits is transmitted by the source to the time it is fully decoded by the sinks. We show that scalar linear codes are not optimal even for multicast when the data has deadlines. In… (More)