Equivalent Conditions to Determine the GEKs by the LEKs in a Convolutional Network Code over a Cyclic Network

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, the correspondence between the weighted line graph and the Mason signal flow graph (MSFG) has been established, which gives an interpretation of a convolutional network code (CNC) over a cyclic network from a different perspective. Furthermore, by virtue of Mason theorem, we present two new equivalent conditions to evaluate whether the global encoding kernels (GEKs) can be uniquely determined by the given complete set of local encoding kernels (LEKs) in a CNC over a cyclic network. These two new equivalent conditions turn out to be more intuitive. Moreover, we give an alternative simple proof of an existing result.

• The Institute of Electronics, Information and Communication Engineersの論文

著者

• Guo Wangmei

  State Key Lab. Of Isn Xidian University

• GUO Wangmei

  State Key Laboratory of ISN, Xidian University

• ZHAO Xubo

  State Key Laboratory of ISN, Xidian University

• ZHAO Xubo

  State Key Lab. of ISN, Xidian University

関連論文

• The Minimum Decoding Delay for Convolutional Network Coding
• Scalar Linear Solvability of Matroidal Error Correction Network
• Linear Complexity of Binary Whiteman Generalized Cyclotomic Sequences of Order 4
• Equivalent Conditions to Determine the GEKs by the LEKs in a Convolutional Network Code over a Cyclic Network

スポンサーリンク