Log-logarithmic Time Pruned Polar Coding on Binary Erasure Channels release_mfax67rzczdwff6c7xx5cgpjri

by Hsin-Po Wang, Iwan Duursma

Released as a article .

2018  

Abstract

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 10.1109/LCOMM.2011.101811.111480], and then analyzes the performance using [Guruswami-Xia arXiv:1304.4321] or [Mondelli-Hassani-Urbanke arXiv:1501.02444].
In text/plain format

Archived Files and Locations

application/pdf  304.8 kB
file_b257qqgr3nfpfcyfhmh4g36ouq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2018-12-19
Version   v1
Language   en ?
arXiv  1812.08106v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 6c3f6ab9-60bf-4d5a-a698-eafe3ed1f031
API URL: JSON