• Corpus ID: 56475951

# Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability

@article{Wang2018PolarlikeCA,
title={Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability},
author={Hsin-Po Wang and Iwan M. Duursma},
journal={ArXiv},
year={2018},
volume={abs/1812.08112}
}
• Published 19 December 2018
• Computer Science
• ArXiv

### Scaling Exponent of List Decoders With Applications to Polar Codes

• Computer Science
IEEE Transactions on Information Theory
• 2015
It is shown that under 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.

### Near-optimal finite-length scaling for polar codes over large alphabets

• Computer Science
2016 IEEE International Symposium on Information Theory (ISIT)
• 2016
The primary result is that, for any γ > 0 and δ > 0, there is a q<sub>0</sub> such that the fraction of effective channels with erasure rate at most N<sup>-γ</sup> is at least 1 - ε - O(N<Sup>-1/2+δ</sup>.

### On Finite-Length Performance of Polar Codes: Stopping Sets, Error Floor, and Concatenated Design

• Computer Science
IEEE Transactions on Communications
• 2013
A polar code-based concatenated scheme to be used in Optical Transport Networks (OTNs) is proposed and it is shown that the proposed scheme outperforms the existing methods by closing the gap to the capacity while avoiding error floor, and maintaining a low complexity at the same time.