Observations on Polar Coding with CRC-Aided List Decoding
David Robert Wasserman · 2016
Abstract : This report may be of interest to researchers in polar codes. It describes some counterintuitive results we have encountered in our polar codes research. The following statements are based on simulation results; we have no proofs, and some of them we are unable to explain: (1) the min-sum approximation causes undetected errors in a successive cancellation decoder, (2) in some cases, an undetected frame error tends to include fewer bit errors than a detected frame error, and (3) different cyclic redundancy check polynomials of the same length can produce different results.