@InProceedings{guruswami_et_al:LIPIcs.CCC.2015.42,
author = {Guruswami, Venkatesan and Velingker, Ameya},
title = {{An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {42--57},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.42},
URN = {urn:nbn:de:0030-drops-50755},
doi = {10.4230/LIPIcs.CCC.2015.42},
annote = {Keywords: Polar codes, polynomial gap to capacity, entropy sumset inequality, arbitrary alphabets}
}