Construction of network codes
Living in a world where communication is practically indispensable, we are interested in how network coding achieves bandwidth optimality between communication networks. In this report, we will study the Max-flow Min cut theorem which states that the maximum flow is tantamount to the bottleneck of t...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/17625 |