Scaling Exponent of List Decoders With Applications to Polar Codes

Motivated by the significant performance gains which polar codes experience under successive cancellation list decoding, their scaling exponent is studied as a function of the list size. In particular, the error probability is fixed, and the tradeoff between the block length and back-off from capacity is analyzed. A lower bound is provided on the error probability under $\rm MAP$ decoding with list size $L$ for any binary-input memoryless output-symmetric channel and for any class of linear codes such that their minimum distance is unbounded as the block length grows large. Then, it is shown that under $\rm MAP$ decoding, although the introduction of a list can significantly improve the involved constants, the scaling exponent itself, i.e., the speed at which capacity is approached, stays unaffected for any finite list size. In particular, this result applies to polar codes, since their minimum distance tends to infinity as the block length increases. A similar result is proved for genie-aided successive cancellation decoding when transmission takes place over the binary erasure channel, namely, the scaling exponent remains constant for any fixed number of helps from the genie. Note that since genie-aided successive cancellation decoding might be strictly worse than successive cancellation list decoding, the problem of establishing the scaling exponent of the latter remains open.

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

[2]  Rüdiger L. Urbanke,et al.  Finite-Length Scaling for Polar Codes , 2013, IEEE Transactions on Information Theory.

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

[4]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[5]  H. Chernoff A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[6]  R. Gallager Information Theory and Reliable Communication , 1968 .

[7]  R. Dobrushin Mathematical Problems in the Shannon Theory of Optimal Coding of Information , 1961 .

[8]  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.

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

[10]  Toshiyuki Tanaka,et al.  Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization , 2011, IEEE Transactions on Information Theory.

[11]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

[12]  Andrea Montanari,et al.  An empirical scaling law for polar codes , 2010, 2010 IEEE International Symposium on Information Theory.

[13]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[14]  G. David Forney,et al.  Exponential error bounds for erasure, list, and decision feedback schemes , 1968, IEEE Trans. Inf. Theory.

[15]  Masahito Hayashi,et al.  Information Spectrum Approach to Second-Order Coding Rate in Channel Coding , 2008, IEEE Transactions on Information Theory.

[16]  V. F. Kolchin,et al.  Random Graphs: Contents , 1998 .

[17]  Elwyn R. Berlekamp,et al.  Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II , 1967, Inf. Control..

[18]  C. Fortuin,et al.  Correlation inequalities on some partially ordered sets , 1971 .

[19]  Vladimir M. Blinovsky,et al.  List decoding , 1992, Discret. Math..

[20]  Shlomo Shamai,et al.  Performance Bounds for Erasure, List, and Decision Feedback Schemes With Linear Block Codes , 2010, IEEE Transactions on Information Theory.

[21]  David Burshtein,et al.  Improved Bounds on the Finite Length Scaling of Polar Codes , 2013, IEEE Transactions on Information Theory.

[22]  Rudiger Urbanke,et al.  Exchange of Limits: Why Iterative Decoding Works , 2011, IEEE Trans. Inf. Theory.

[23]  C. J. Preston,et al.  A generalization of the FKG inequalities , 1974 .

[24]  Peter Elias,et al.  List decoding for noisy channels , 1957 .

[25]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[26]  Emre Telatar,et al.  On the rate of channel polarization , 2008, 2009 IEEE International Symposium on Information Theory.

[27]  Alexander Barg,et al.  Random codes: Minimum distances and error exponents , 2002, IEEE Trans. Inf. Theory.

[28]  Andrea Montanari,et al.  Further results on finite-length scaling for iteratively decoded LDPC ensembles , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..