Please use this identifier to cite or link to this item:
Title: Construction of network codes
Authors: Shen, Vinson Qinglin.
Keywords: DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems
Issue Date: 2009
Abstract: 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 the network. Besides, we will introduce the basic concept of network coding and technical terms that is used throughout the project and report. Examples of these terms are the local encoding kernels and the global encoding kernels. The advantage of network coding over routing will also be mentioned in this report. Next, we will proceed with the discussion of network codes. Among all the possible network codes, we have placed our emphasis on the Jaggi-Sander Algorithm which constructs a linear multicast deterministically in polynomial time. An explicit explanation of the algorithm will be also presented. After which, we will go through the flow chart that will be used to construct the Jaggi Sanders Algorithm. In addition to that, we will briefly introduce the MATLAB software that is used in the construction of the network code. Last but not least, we will also present our failure milestone encountered in the course of the project and the possible further works.
Schools: School of Electrical and Electronic Engineering 
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
  Restricted Access
1.68 MBMicrosoft WordView/Open

Page view(s)

Updated on Sep 30, 2023


Updated on Sep 30, 2023

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.