A lower bound on the probability of error of polar codes over BMS channels

Consider a polar code designed for some binary memoryless symmetric channel. We develop a lower bound on the probability of error of this polar code under successive-cancellation decoding. The bound exploits the correlation between the various codeword bits and improves upon existing lower bounds.

[1]  Eren Sasoglu.  Polarization in the presence of memory , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[2]  Eren Sasoglu,et al.  Polarization and Polar Codes , 2012, Found. Trends Commun. Inf. Theory.

[3]  Emre Telatar,et al.  On the correlation between polarized BECs , 2013, 2013 IEEE International Symposium on Information Theory.

[4]  Donald E. Knuth.  Two notes on notation , 1992 .

[5]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.

[6]  Johannes B. Huber,et al.  Information Combining , 2006, Found. Trends Commun. Inf. Theory.

[7]  Steven J. Schwager.  Bonferroni Sometimes Loses , 1984 .

[8]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[9]  Ole Tange,et al.  GNU Parallel: The Command-Line Power Tool , 2011, login Usenix Mag..

[10]  Ido Tal,et al.  Polar coding for processes with memory , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[11]  Alexander Vardy,et al.  List Decoding of Polar Codes , 2015, IEEE Transactions on Information Theory.

[12]  John Fan.  Constrained Coding and Error- Control Coding , 2004 .

[13]  Junya Honda,et al.  Polar Coding Without Alphabet Extension for Asymmetric Models , 2013, IEEE Transactions on Information Theory.

[14]  Erdal Arikan,et al.  Source polarization , 2010, 2010 IEEE International Symposium on Information Theory.

[15]  Conrad Sanderson,et al.  Armadillo: a template-based C++ library for linear algebra , 2016, J. Open Source Softw..

[16]  Ido Tal,et al.  Fast Polarization for Processes with Memory , 2017, 2018 IEEE International Symposium on Information Theory (ISIT).

[17]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[18]  Ryuhei Mori,et al.  Performance and construction of polar codes on symmetric binary-input memoryless channels , 2009, 2009 IEEE International Symposium on Information Theory.

[19]  Alexander Vardy,et al.  How to Construct Polar Codes , 2011, IEEE Transactions on Information Theory.

[20]  Ido Tal,et al.  A Lower Bound on the Probability of Error of Polar Codes over BMS Channels , 2019, IEEE Transactions on Information Theory.

[21]  Fred M. Hoppe,et al.  Iterating bonferroni bounds , 1985 .