Exact Decoding Probability of Random Linear Network Coding for Combinatorial Networks  

作　　者：LI Fang 

机构地区：[1]School of Information, Xi’an University of Finance and Economics [2]State Key Laboratory of Integrated Services Networks (ISN), Xidian University

出　　处：《Wuhan University Journal of Natural Sciences》2015年第5期391-396,共6页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foundation of China(61271174,61301178);the Science and Technology Innovation Foundation of Xi’an(CXY1352WL28)

摘　　要：Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in which one source sends messages to k destinations through m relays using random linear network coding over a Galois field. The formulation at a （all） sink（s） represents the impact of major parameters, i.e., the size of field, the number of relays （and sinks） and provides theoretical groundings to numerical results in the literature. Such condition maps to the receivers＇ capability to decode the original information and its mathematical characterization is helpful to design the coding. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized.Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in which one source sends messages to k destinations through m relays using random linear network coding over a Galois field. The formulation at a （all） sink（s） represents the impact of major parameters, i.e., the size of field, the number of relays （and sinks） and provides theoretical groundings to numerical results in the literature. Such condition maps to the receivers＇ capability to decode the original information and its mathematical characterization is helpful to design the coding. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized.

关 键 词：random linear network coding successful probability combinatorial networks 

分 类 号：TN911.22[电子电信—通信与信息系统] TP311[电子电信—信息与通信工程]