Technical Program

Paper Detail

Paper IDC.3.3
Paper Title Iterative Decoding of Non-Binary Cyclic Codes Using Minimum-Weight Dual Codewords
Authors Jiongyue Xing, Sun Yat-sen University, China; Martin Bossert, Sebastian Bitzer, Ulm University, Germany; Li Chen, Sun Yat-sen University, China
Session C.3: Iterative Decoding
Presentation Lecture
Track Coding for Communications
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract This paper proposes a novel shift-sum decoding scheme for non-binary cyclic codes. Using minimum-weight dual codewords and their cyclic shifts, a reliability measure can be yielded as an indicator for the error position and the error magnitude. Based on this shift-sum decoding concept, a hard-decision iterative decoding algorithm is proposed, which can correct errors beyond half of the code's minimum Hamming distance. By utilizing reliability information from the channel, a soft-decision iterative decoding algorithm is further introduced to improve the decoding performance. These two shift-sum based iterative decoding algorithms are realized with polynomial multiplication and integer (or real number) comparisons, which are hardware-friendly. Simulation results on Reed-Solomon codes and non-binary BCH codes show the decoding potential of the proposed algorithms.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!