Inproceedings,

An empirical scaling law for polar codes

, , , and .
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on, page 884-888. (June 2010)
DOI: 10.1109/ISIT.2010.5513579

Abstract

Using scaling laws, we obtain estimates of the block error probability of polar codes under successive cancellation decoding. For the binary erasure channel we present an upper and a lower bound for the scaling parameter. Numerically these two bounds match. We also present a scaling law for general binary discrete memoryless channels.

Tags

Users

  • @ytyoun

Comments and Reviews