Type of Document	Master's Thesis
Author	Li, Shoupei
Author's Email Address	sli2@lsu.edu
URN	etd-04032006-004254
Title	Design of Linear Boolean Network Codes on Combination Networks
Degree	Master of Science (M.S.)
Department	Electrical & Computer Engineering
Advisory Committee	Advisor Name Title Xue-Bin Liang Committee Chair Guoxiang Gu Committee Member Morteza Naraghi-Pour Committee Member
Keywords	min-cut max-flow combination network network coding linear boolean network codes
Date of Defense	2006-03-28
Availability	unrestricted
Abstract Network coding is a promising technique to improve the throughput of communication networks. In the thesis, we investigate linear Boolean network codes on a special class of multicast networks, called combination networks. Using companion matrices of primitive polynomials over finite fields, we design a class of symmetric linear Boolean network codes from Reed-Solomon codes for single-source combination networks. We also prove that, for some cases, the linear Boolean network codes are optimal in the sense of minimum network uses. In the thesis, we further consider two-source network coding problem for combination networks and other specific networks. We develop a method to evaluate an outer bound for these two-source networks. By designing linear Boolean network codes which achieve extreme points of rate regions, we show that the outer bound is actually tight for some of these networks.
Files	Filename       Size       Approximate Download Time (Hours:Minutes:Seconds)     28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access    Li_thesis.pdf 1.06 Mb 00:04:53 00:02:30 00:02:12 00:01:06 00:00:05