Network Coding Based on Byte-wise Circular Shift and Integer Addition
Network Coding Based on Byte-wise Circular Shift and Integer Addition
K. Shum,Hanxu Hou
2020 · DOI: 10.1109/ISIT44484.2020.9174327
International Symposium on Information Theory · 4 Citations
TLDR
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, which can be executed efficiently in microprocessors.
Abstract
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.