Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 2003 | Published
Book Section - Chapter Open

Low complexity algebraic multicast network codes

Abstract

We present a low complexity algorithm for designing algebraic codes that achieve the info mation theoretic capacity for the multicast problem on directed acyclic networks. These codes operate over field sizes which are significantly smaller than those previously known, leading to significantly lower design and implementation complexity, and network link usage. These codes can be extended for networks with cycles and delays, and for robustness properties.

Additional Information

© 2003 IEEE. The first author was supported by Microsoft Corporation.

Attached Files

Published - 01228384.pdf

Files

01228384.pdf
Files (143.9 kB)
Name Size Download all
md5:cc87d3d6c2444fb5430ae7cc8d7c998d
143.9 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 25, 2023