Jaggi, Sidharth and Chou, Philip A. and Jain, Kamal (2003) Low complexity algebraic multicast network codes. In: IEEE International Symposium on Information Theory, 2003. Proceedings. IEEE , Piscataway, NJ, p. 368. ISBN 0-7803-7728-1. https://resolver.caltech.edu/CaltechAUTHORS:20170522-154344636
![]() |
PDF
- Published Version
See Usage Policy. 143kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170522-154344636
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.
Item Type: | Book Section | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
Related URLs: |
| |||||||||
Additional Information: | © 2003 IEEE. The first author was supported by Microsoft Corporation. | |||||||||
Funders: |
| |||||||||
DOI: | 10.1109/ISIT.2003.1228384 | |||||||||
Record Number: | CaltechAUTHORS:20170522-154344636 | |||||||||
Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20170522-154344636 | |||||||||
Official Citation: | S. Jaggi, P. A. Chou and K. Jain, "Low complexity algebraic multicast network codes," IEEE International Symposium on Information Theory, 2003. Proceedings., 2003, pp. 368-368. doi: 10.1109/ISIT.2003.1228384 | |||||||||
Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
ID Code: | 77635 | |||||||||
Collection: | CaltechAUTHORS | |||||||||
Deposited By: | INVALID USER | |||||||||
Deposited On: | 22 May 2017 23:08 | |||||||||
Last Modified: | 15 Nov 2021 17:32 |
Repository Staff Only: item control page