|
|
|
| Design and Analysis of Network Coding Algorithm in k-Redundant Multicast Network |
| Wang Jing①②; Liu Xiang-yang③; Wang Xin-mei① |
| ①State Key Lab of Integrated Service Networks, Xidian University., Xi'an 710071, China; ②School of Information Engineering, Chang'an University, Xi'an 710064, China; ③Military Comprehensive Information Network Teaching Office, Xi'an Communication College, Xi’an 710106, China |
|
|
|
|
Abstract For k-redundant multicast network, the maximum multicast rate can be achieved with network coding. The minimal finite field which is enough to implement network coding for different multicast rate in k-redundant multicast network is obtained, by using some results of MDS codes available. To design codes of multicast network and implement network coding, a generator matrix of a [n, k] MDS code is constructed based on the obtained minimal finite field, and its column vectors are allocated to output links of the source as their global coding vectors. An application instance shows that, compared with present universal approaches of network coding, this approach has lower computation complexity.
|
|
Received: 20 May 2008
|
|
|
|
|
|
|
|
|
2009, Vol. 31 
