arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1912.08995cs.ITmath.IT
收藏

Polar码的简单性,随机码的耐用性

Polar Codes' Simplicity, Random Codes' Durability

Hsin-Po Wang, Iwan Duursma

摘要:

在任何离散无记忆信道上,我们构建代码,使得:其一,它们的误块概率和码率像随机码一样缩放;其二,它们的编码和解码复杂度像极坐标码一样缩放。量化,对于任何常数$π,ρ>0$,使得$π+2ρ<1$,我们构造了一个纠错码序列,其块长度$N$接近无穷大,块错误概率$\exp(-N^π)$,码率$N^{-ρ}$小于香农容量,每个码块的编码和解码复杂度$O(N\log N)$。假定码采用统一的$ς$ -ary消息,供发送者选择素数$ς$。假定的代码是最佳的,在以下方式:应该$π+2ρ>1$,没有这样的代码存在的通用信道,不管字母表和复杂性。

英文摘要:

Over any discrete memoryless channel, we build codes such that: for one, their block error probabilities and code rates scale like random codes'; and for two, their encoding and decoding complexities scale like polar codes'. Quantitatively, for any constants $π,ρ>0$ such that $π+2ρ<1$, we construct a sequence of error correction codes with block length $N$ approaching infinity, block error probability $\exp(-N^π)$, code rate $N^{-ρ}$ less than the Shannon capacity, and encoding and decoding complexity $O(N\log N)$ per code block. The putative codes take uniform $ς$-ary messages for sender's choice of prime $ς$. The putative codes are optimal in the following manner: Should $π+2ρ>1$, no such codes exist for generic channels regardless of alphabet and complexity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑