Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels

DOI10.1109/TIT.2020.3038806zbMath1486.94164arXiv1711.01339OpenAlexW3099794497MaRDI QIDQ4958259

Hamed Hassani, Marco Mondelli, Arman Fazeli, Alexander Vardy

Publication date: 7 September 2021

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

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

zbMATH Keywords

binary codesoptimal scalingpolar codesbinary erasure channelquasi-linear complexity of encoding and decoding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Related Items (3)

General Strong Polarization ⋮ Design and decoding of polar codes with large kernels: a survey ⋮ Reed-Muller Codes

This page was built for publication: Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels