Successive Cancellation Decoding of $\mathbb{Z}_{2^{S}}$ Splitting Codes

In this paper, we introduce an improved suboptimal SISO decoding algorithm for splitting codes - a class of linear codes over the $\mathbb{Z}_{2^{S}}$ ring (the ring of integers modulo $2^{S})$ , based on the lifting decoder technique. This algorithm is demonstrated for generalized Kerdock codes, and it is compared to the MAP decoding algorithm in terms of its error correction performance. Simulations show that our novel algorithm has a comparable error correction performance to the optimal decoder with significantly lower decoding complexity. In the case of the generalized Kerdock codes, our algorithm has the complexity of $O(SN\log_{2}N)$ , where $N$ is the code length in $\mathbb{Z}_{2^{S}}$ , i.e. the number of ring elements in a codeword.