• [1] E. Arikan, Channel polarization: A method for constructing capacity achieving codes for symmetric binary-input memoryless channels, IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051-3073, July 2009.

• [2] E. Arikan, Systematic polar coding, IEEE Commun. Lett., vol. 15, no. 8, pp. 860-862, 2011.

• [3] I. Tal and A. Vardy, List decoding of polar codes, IEEE Transactions on Information Theory, vol. 61, no. 5, pp. 2213-2226, May 2015.

• [4] A. Elkelesh, M. Ebada, S. Cammerer, and S. ten Brink, Improving belief propagation decoding of polar codes using scattered EXIT charts, in IEEE Information Theory Workshop (ITW), September 2016.

• [5] I. Tal and A. Vardy, How to construct polar codes, IEEE Transactions on Information Theory, vol. 59, no. 10, pp. 6562-6582, Oct 2013.

• [6] P. Trifonov, Efficient design and decoding of polar codes, IEEE Transactions on Communications, vol. 60, no. 11, pp. 3221-3227, November 2012.

• [7] G. Sarkis, I. Tal, P. Giard, A. Vardy, C. Thibeault, and W. J. Gross, Flexible and low-complexity encoding and decoding of systematic polar codes, CoRR, vol. abs/1507.03614, 2015. [Online]. Available: http://arxiv.org/abs/1507.03614

• [8] K. Niu, K. Chen, J. Lin, and Q. T. Zhang, Polar codes: Primary concepts and practical decoding algorithms, IEEE Communications Magazine, vol. 52, no. 7, pp. 192-203, July 2014.

• [9] M. Bardet, V. Dragoi, A. Otmani, and J. Tillich, “Algebraic Properties of Polar Codes From a New Polynomial Formalism,” in IEEE Inter. Symp. Inf. Theory (ISIT), Jul. 2016, pp. 230–234.

• [10] M. Geiselhart, A. Elkelesh, M. Ebada, S. Cammerer and S. ten Brink, “On The Automorphism Group of Polar Codes," in preparation, 2021