Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Bounds:
TR03-033 | 6th May 2003
Meir Feder, Dana Ron, Ami Tavory

Bounds on Linear Codes for Network Multicast

Comments: 1

Traditionally, communication networks are composed of
routing nodes, which relay and duplicate data. Work in
recent years has shown that for the case of multicast, an
improvement in both rate and code-construction complexity can be
gained by replacing these routing nodes by linear coding
nodes. These nodes transmit linear combinations ... more >>>

ISSN 1433-8092 | Imprint