论文标题
基于字节循环和整数添加的网络编码
Network Coding Based on Byte-wise Circular Shift and Integer Addition
论文作者
论文摘要
特殊类别的Galois环的新颖实现，其中可以通过循环卷积实现乘法，将其应用于网络代码的构建。所涉及的原始操作是字节偏移和整数添加2个功率2。它们俩都可以在微处理器中有效地执行。在本文的末尾给出了如何将该想法应用于数组代码的说明。
A novel implementation of a special class of Galois ring, in which the multiplication can be realized by a cyclic convolution, is applied to the construction of network codes. The primitive operations involved are byte-wise shifts and integer additions modulo a power of 2. Both of them can be executed efficiently in microprocessors. An illustration of how to apply this idea to array code is given at the end of the paper.
