Algebraic approach to random convolutional network coding over wireless packet networks
Wangmei Guo , Binyue Liu , Fuwei Jiang
Transactions of Tianjin University ›› 2013, Vol. 19 ›› Issue (4) : 307 -312.
Algebraic approach to random convolutional network coding over wireless packet networks
To characterize the algebraic structure of wireless network coding, a hypergragh is utilized to model wireless packet networks from network layer. The algebraic description of random convolutional network coding is deduced, and the coding condition is also presented. Analyses and simulations show that random convolutional coding is capacity-achieving with probability approaching 1.
wireless network coding / random convolutional network coding / hypergraph / capacity-achieving
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
/
| 〈 |
|
〉 |