Date Added: Oct 2010
Polar codes have been recently proposed as the first low complexity class of codes that can provably achieve the capacity of symmetric binary-input memoryless channels. Here, the authors study the bit error rate performance of finite-length polar codes under Belief Propagation (BP) decoding. They analyze the stopping sets of polar codes and the size of the minimal stopping set, called "Stopping distance". Stopping sets, as they contribute to the decoding failure, play an important role in bit error rate and error floor performance of the code. Their simulations asserts that while finite-length polar codes do not perform as good as LDPC codes in terms of bit error rate, they show superior error floor performance.