๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Polynomial time algorithms for multicast network code construction

โœ Scribed by Jaggi, S.; Sanders, P.; Chou, P.A.; Effros, M.; Egner, S.; Jain, K.; Tolhuizen, L.M.G.M.

Book ID
114638778
Publisher
IEEE
Year
2005
Tongue
English
Weight
369 KB
Volume
51
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Network coding for efficient network mul
Network coding for efficient network multicast
โœ Emina Soljanin; Piyush Gupta; Gerhard Kramer ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Institute of Electrical and Electronics Engineers ๐ŸŒ English โš– 131 KB

Network coding has emerged as a powerful technique based on a simple but far-reaching observation that, in communication networks, one can allow intermediate nodes to not only forward but also combine and process the incoming information flows. Today, the field is attracting significant interest fro

Polynomial algorithms for estimating net
Polynomial algorithms for estimating network reliability
โœ Eitan Zemel ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 751 KB

## Abstract We consider the problem of calculating the best possible bounds on the reliability of a system given limited information about the joint density function of its components. We show that a polynomial algorithm for this problem exists iff such an algorithm exists for a certain related pro