Linear network codes on cyclic and acyclic networks

Simple item page
dc.contributor.authorEsmaeili, Ali
dc.contributor.supervisorGulliver, T. Aaron
dc.date.accessioned2016-05-02T18:06:25Z
dc.date.available2016-05-02T18:06:25Z
dc.date.copyright2016en_US
dc.date.issued2016-05-02
dc.degree.departmentDepartment of Electrical and Computer Engineering
dc.degree.levelMaster of Applied Science M.A.Sc.en_US
dc.description.abstractConsider a network which consists of noiseless point to point channels. In this network, the source node wants to send messages to a specific set of sink nodes. If an intermediate node v has just one input channel then the received symbol by that node can be replicated and sent to the outgoing channels from v. If v has at least two incoming channels then it has two options. It can either send the received symbols one-by-one, one symbol in each time unit, or v can transmit a combination of the received symbols. The former choice takes more time compared to the latter option, which is called network coding. In the literature, it has been shown that in a single source finite acyclic network the maximum throughput can be achieved by using linear network codes. Significant effort has been made to efficiently construct good network codes. In addition, a polynomial time algorithm for constructing a linear network code on a given network was introduced. Also an algorithm for constructing a linear multicast code on an acyclic network was introduced. Finally, a method for finding a representation matrix for the network matroid of a given network G was also introduced. This matrix can be used to construct a generic code. In this thesis we first provide a review of some known methods for constructing linear multicast, broadcast and dispersion codes for cyclic and acyclic networks. We then give a method for normalization of a non-normal code, and also give a new algorithm for constructing a linear multicast code on a cyclic network. The construction of generic network codes is also addressed.en_US
dc.description.proquestcode0984en_US
dc.description.proquestcode0544en_US
dc.description.proquestemailesmaeili@uvic.caen_US
dc.description.scholarlevelGraduateen_US
dc.identifier.urihttp://hdl.handle.net/1828/7252
dc.languageEnglisheng
dc.language.isoenen_US
dc.rightsAvailable to the World Wide Weben_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/ca/*
dc.subjectlinear network codesen_US
dc.subjectlinear multicast codeen_US
dc.subjectlinear broadcast codeen_US
dc.subjectlinear dispersion codeen_US
dc.subjectgeneric network codeen_US
dc.subjectcyclic networken_US
dc.subjectacyclic networken_US
dc.subjectnetwork matroiden_US
dc.subjectnormal codeen_US
dc.titleLinear network codes on cyclic and acyclic networksen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Esmaeili_Ali_MASc_2016.pdf
Size:
2.62 MB
Format:
Adobe Portable Document Format
Description:
Main file for Thesis
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.74 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.