Practically Feasible Design for Convolutional Network Code
スポンサーリンク
概要
- 論文の詳細を見る
This paper introduces two schemes to put the decoding of the convolutional network code (CNC) into practice, which are named the Intermittent Packet Transmission Scheme (IPTS) and the Redundancy Packet Transmission Scheme (RPTS). According to the decoding formula of the sink nodes, we can see that, at the time k+δ in order to decode the source packet generated at time k, the sink node should know all the source packets generated before k-1. This is impractical. The two schemes we devised make it unnecessary. A construction algorithm is also given about the RPTS networks. For the two schemes, we analyze the strengths and weaknesses and point out their implemented condition.
- The Institute of Electronics, Information and Communication Engineersの論文
著者
-
Kan Haibin
School Of Compute Science Fudan University
-
LIANG Songtao
School of Computer Science, Fudan University
関連論文
- A New Quaternion Design for Space-Time-Polarization Block Code with Full Diversity
- New Balanced Boolean Functions with Good Cryptographic Properties
- Constructing Even-Variable Symmetric Boolean Functions with High Algebraic Immunity
- Constructing Correlation Immune Symmetric Boolean Functions
- Annihilators and Algebraic Immunity of Symmetric Boolean Functions
- A Note on "On the Construction of Boolean Functions with Optimal Algebraic Immunity"
- A Note on "On the Construction of Boolean Functions with Optimal Algebraic Immunity"
- Practically Feasible Design for Convolutional Network Code