Authors: Ilya Dumer
Addresses: University of California at Riverside, Riverside, CA 92521, USA
Abstract: We consider Plotkin-type constructions that perform a multi-step recursive decomposition of a given code into the shorter codes and are similar to polar and Reed-Muller (RM) codes. However, we end this decomposition process at the various short codes instead of the single information bits used as end nodes in polar design. We also employ maximum likelihood (ML) decoding of the end codes. Such a design can reduce the output error rates of polarised constructions on the moderate blocklengths. We also analyse the complexity-performance trade-offs in order to optimise code design.
Keywords: polar codes; Reed-Muller codes; Boolean polynomials; recursive decoding; maximum likelihood decoding; Plotkin-type constructions; code design.
International Journal of Information and Coding Theory, 2015 Vol.3 No.2, pp.97 - 106
Available online: 22 Oct 2015Full-text access for editors Access for subscribers Purchase this article Comment on this article