A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Log-logarithmic Time Pruned Polar Coding on Binary Erasure Channels
[article]
2018
arXiv
pre-print
Preserved Fulltext
A pruned variant of polar coding is reinvented for all binary erasure channels. For small ε>0, we construct codes with block length ε^-5, code rate Capacity-ε, error probability ε, and encoding and decoding time complexity O(N|ε|) per block, equivalently O(|ε|) per information bit (Propositions 5 to 8). This result also follows if one applies systematic polar coding [Arıkan 10.1109/LCOMM.2011.061611.110862] with simplified successive cancelation decoding [Alamdar-Yazdi-Kschischang
arXiv:1812.08106v1
fatcat:mfax67rzczdwff6c7xx5cgpjri