Published June 2003
| Published
Book Section - Chapter
Open
Low complexity algebraic multicast network codes
- Creators
- Jaggi, Sidharth
- Chou, Philip A.
- Jain, Kamal
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
- Eprint ID
- 77635
- Resolver ID
- CaltechAUTHORS:20170522-154344636
- Microsoft Corporation
- Created
-
2017-05-22Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field