Collaborative Research - MSPA-MCS: Network Coding

University Enterprises Corporation At Csusb, San Bernardino CA

Investigators

Abstract

This project studies the mathematical and algorithmic theory of the newly emerging field of network coding. Network coding offers the promise of improved performance over traditional network routing techniques. Emphasis is placed on the fundamental theory of communication in networks that allow coding in addition to routing. Applications include improved throughput in packet networks and power savings in wireless ad hoc networks. Specific subtopics studied include network solvability, linear coding, non-linear coding, the algebraic structure of symbol alphabets, multicast communications, point-to-point communications, and bi-directional coding and routing. The theory of network coding is still in its infancy and little is known about practical algorithms for exploiting coding in real networks, such as the Internet. The objectives are to achieve a deep mathematical understanding of network coding and to develop practical algorithms that can be effectively used in real applications. The work exploits the diverse mathematical and computer science backgrounds of the PIs. The investigation involves mathematical analysis, algorithm design, and computer simulation. The main topic areas investigated are: (i) Applications of matroid theory to network coding; (ii) Algorithms for network solvability, capacity computation, and code design; (iii) Theory and algorithms for bi-directional networks; (iv) Theory and design of robust networks