The Average Failure Probabilities of Random Linear Network Coding
Summary :
In network coding, for the case that the network topology is unknown completely, random linear network coding has been proposed as an acceptable coding technique. In this paper, we define average failure probability of random linear network coding in order to characterize the performance of random network coding, and then analyze this failure probability for different known topological information of network. We obtain several upper bounds on the failure probabilities, and further show that, for some networks, these upper bounds are tight or asymptotically tight. Moreover, if the more topological information of the network is utilized, the better upper bounds are acquired.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.10 pp.1991-2001
- Publication Date
- 2011/10/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E94.A.1991
- Type of Manuscript
- PAPER
- Category
- Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Xuan GUANG, Fang-Wei FU, "The Average Failure Probabilities of Random Linear Network Coding" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 10, pp. 1991-2001, October 2011, doi: 10.1587/transfun.E94.A.1991.
Abstract: In network coding, for the case that the network topology is unknown completely, random linear network coding has been proposed as an acceptable coding technique. In this paper, we define average failure probability of random linear network coding in order to characterize the performance of random network coding, and then analyze this failure probability for different known topological information of network. We obtain several upper bounds on the failure probabilities, and further show that, for some networks, these upper bounds are tight or asymptotically tight. Moreover, if the more topological information of the network is utilized, the better upper bounds are acquired.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.1991/_p
Copy
@ARTICLE{e94-a_10_1991,
author={Xuan GUANG, Fang-Wei FU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The Average Failure Probabilities of Random Linear Network Coding},
year={2011},
volume={E94-A},
number={10},
pages={1991-2001},
abstract={In network coding, for the case that the network topology is unknown completely, random linear network coding has been proposed as an acceptable coding technique. In this paper, we define average failure probability of random linear network coding in order to characterize the performance of random network coding, and then analyze this failure probability for different known topological information of network. We obtain several upper bounds on the failure probabilities, and further show that, for some networks, these upper bounds are tight or asymptotically tight. Moreover, if the more topological information of the network is utilized, the better upper bounds are acquired.},
keywords={},
doi={10.1587/transfun.E94.A.1991},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - The Average Failure Probabilities of Random Linear Network Coding
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1991
EP - 2001
AU - Xuan GUANG
AU - Fang-Wei FU
PY - 2011
DO - 10.1587/transfun.E94.A.1991
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2011
AB - In network coding, for the case that the network topology is unknown completely, random linear network coding has been proposed as an acceptable coding technique. In this paper, we define average failure probability of random linear network coding in order to characterize the performance of random network coding, and then analyze this failure probability for different known topological information of network. We obtain several upper bounds on the failure probabilities, and further show that, for some networks, these upper bounds are tight or asymptotically tight. Moreover, if the more topological information of the network is utilized, the better upper bounds are acquired.
ER -
English
