为保证码字性能，提出了校验节点合并的三个限制条件。
And three restriction conditions for merging check nodes are proposed in order to get good performance codes.
在此基础上引入基于校验节点的串行消息传递机制并提出具体可实现的解码算法模型。
On this basis, we introduce a serial mechanism based on check nodes and propose a concrete and feasible decoding algorithm modeling.
该文研究多个存活校验节点的作用，提出MSCN打孔方案最大化打孔节点的存活校验节点数。
This paper investigates the effect of multiple survived check nodes, and proposes an effective puncturing scheme called MSCN, which maximizes the number of survived check nodes.
该算法通过对校验节点传递给比特节点的信息进行有效简化，使计算复杂度接近“最小和”算法。
By simplifying the message sent from check nodes to bit nodes, the complexity of the algorithm approaches that of the "mini-sum" algorithm.
如果参与节点已经安装了hashcash(而不是一些定制的软件工具)，那么，对hashcash质询的回答就可以作为一种“必须达到某种高度才能登堂入室(you mustbethistalltoenter thisride)”风格的校验。
And if candidate nodes already have hashcash installed (but not some custom software tool), answering a hashcash challenge can act as a sort of "you must be this tall to enter this ride" style check.
由于在VOD系统中存放的数据都是一些视频流，我们分析了一种改进的RAID5技术——基于奇偶校验数据重构恢复的数据节点阵列RAID5。
Since the data stored in VOD system is a kind of video stream, we can use an improved RAID5 technology to improve the efficiency of data reconstructing operation in disk failure.
然后是用F—统计量法对物流节点类型确定的聚类结果进行校验，分析其聚类效果是否满意，合并是否合理。
Thirdly, use F-test to analyze whether the results got by the method forward used are satisfactory and reasonable or not.
该方法在中继节点通过校验码等方式判别来自两个终端的数据包是否正确解码后，自适应地进行网络编码、中继转发处理。
Traditional network coding has a limited application for assuming the input packets from two destination nodes can be simultaneously decoded correctly at the relay node.
该方法在中继节点通过校验码等方式判别来自两个终端的数据包是否正确解码后，自适应地进行网络编码、中继转发处理。
Traditional network coding has a limited application for assuming the input packets from two destination nodes can be simultaneously decoded correctly at the relay node.
应用推荐