TY - GEN
T1 - Low complexity algebraic multicast network codes
AU - Jaggi, Sidharth
AU - Chou, Philip A.
AU - Jain, Kamal
PY - 2003
Y1 - 2003
N2 - We present a low complexity algorithm for designing algebraic codes that achieve the information 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.
AB - We present a low complexity algorithm for designing algebraic codes that achieve the information 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.
UR - http://www.scopus.com/inward/record.url?scp=0141973572&partnerID=8YFLogxK
U2 - 10.1109/isit.2003.1228384
DO - 10.1109/isit.2003.1228384
M3 - Conference Contribution (Conference Proceeding)
AN - SCOPUS:0141973572
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 368
BT - Proceedings of the International Symposium on Information Theory
T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)
Y2 - 29 June 2003 through 4 July 2003
ER -