  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.
