Recursive descriptions of polar codes

Noam Presman, Simon Litsyn

Research output: Contribution to journalArticlepeer-review


Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. Using such description allows an easy development of these algorithms for arbitrary polarizing kernels. Hardware architectures for these decoding algorithms are also described in a recursive way, both for Arıkan’s standard polar codes and for arbitrary polarizing kernels.

Original languageEnglish
Pages (from-to)1-65
Number of pages65
JournalAdvances in Mathematics of Communications
Issue number1
StatePublished - Feb 2017


  • Decoding
  • Encoding
  • Error correction coding
  • Polar coding


Dive into the research topics of 'Recursive descriptions of polar codes'. Together they form a unique fingerprint.

Cite this