Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding

DOI10.1109/TIT.2019.2917683MaRDI QIDQ5211396zbMATH OpenOpenAlexWikidataFDO

Authors Christopher G. Blake, Frank R. Kschischang

Publication date 28 January 2020

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

Full work available at URL https://doi.org/10.1109/tit.2019.2917683

Mathematics Subject Classification ID

Bounds on codes (94B65)

Cited in

(2)

• scientific article; zbMATH DE number 3890761 (Why is no real title available?)
• On the Finite Length Scaling of <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math> </inline-formula>-Ary Polar Codes

This page was built for publication: Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211396)