Algebraic Approach to Random Convolutional Network Coding over Wireless Packet Networks  

作　　者：郭网媚 刘斌越 蒋馥蔚 

机构地区：[1]State Key Laboratory of Integrated Services Network, Xidian University [2]Information and Navigation College, Air Force Engineering University

出　　处：《Transactions of Tianjin University》2013年第4期307-312,共6页天津大学学报（英文版）

基　　金：Supported by National Natural Science Foundation of China (No.61271174);Young Teachers' Innovation Foundation of Xidian University(K5051303137)

摘　　要：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.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 

分 类 号：TN92[电子电信—通信与信息系统]