Abstract
The random linear network coding was proposed as an adoptable coding technique for many practical communication networks. This study focuses on analysing the failure probabilities of random linear network coding to study its performance for multicast network, emphatically some known upper bounds of the failure probabilities have been improved and the worst cases are indicated for these bounds. Besides, if the more network topology information is achieved, the better upper bounds can be obtained. Furthermore when the field size goes to infinity the limit behaviours of the failure probabilities are discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.