#### Filter Results:

#### Publication Year

2001

2011

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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)

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)

We study the maximum flow possible between a single-source and multiple terminals in a weighted random graph (modeling a wired network) and a weighted random geometric graph (modeling an ad-hoc wireless network) using network coding. For the weighted random graph model, we show that the network coding capacity concentrates around the expected number of… (More)

- Tracey Ho, Muriel Médard, Ralf Koetter, David R Karger, Michelle Effros, Jun Shi +1 other
- 2004

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

—For trellis codes, generating function techniques provide the distance spectrum and a union bound on bit-error rate. The computation of the generating function of a trellis code may be separated into two stages. The first stage reduces the number of states as much as possible using low-complexity approaches. The second stage produces the generating… (More)

Based on random codes and typical set decoding, an alternative proof of Root and Varaiya's compound channel coding theorem for linear Gaussian channels is presented. The performance limit of codes with finite block length under a compound channel is studied through error bounds and simulation. Although the theorem promises uniform convergence of the… (More)

— Foschini's diagonally layered space-time transmission system known as D-BLAST is an advanced architecture designed for a Rayleigh fading environment using multiple element antenna arrays at both the transmit and receive sites to achieve very high spectral efficiencies. In this paper we examine the performance of trellis codes that are designed to have a… (More)

We describe a working implementation of a streaming encryption system for optical networks. The 10 Gbps data stream is encrypted on the physical level in both the wavelength and time domains. Security is obtained by applying a strong pseudo-random hopping pattern to both. The AES algorithm in counter mode is used to control the switches that implement the… (More)

— Biglieri showed that a diagram with N 2 states can be used to compute the generating function for any trellis code with N states. Rouanne & Costello and Zehavi & Wolf showed that for quasi-regular trellis codes, an N-state diagram produces the correct generating function. Schlegel showed that application of a standard FSM (finite-state-machine)… (More)