Technical Program

Paper Detail

Paper IDN.2.1
Paper Title Network Coding Based on Byte-wise Circular Shift and Integer Addition
Authors Kenneth W. Shum, The Chinese University of Hong Kong (Shenzhen), China; Hanxu Hou, Dongguang University of Technology, China
Session N.2: Network Coding II
Presentation Lecture
Track Networking and Network Coding
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
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.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!