Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets

DOI10.1109/TIT.2019.2915595zbMath1432.94110arXiv1605.01997OpenAlexW2944695332MaRDI QIDQ5211395

Henry David Pfister, Ruediger Urbanke

Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.01997

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Statistical aspects of information-theoretic topics (62B10) Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29)

Related Items (1)

General Strong Polarization

This page was built for publication: Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets