Polar codes with a stepped boundary
Polar codes with a stepped boundary
复制标题
具有阶梯边界的极性码
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
I. Dumer
中科院分区：
文献类型：
--
作者：
I. Dumer
我们设计了块长n→∞和代码速率r→1的极性代码，以实现具有过渡误差概率p→0的二进制对称通道上消失的输出错误率。这些代码的次要冗余顺序（1 -r）n比做其他已知的高速码，例如Reed-Muller（RM）或BCH代码。如果P→1/2，则可以实现消失的输出错误率的低率代码。
We design polar codes of blocklength n→∞ and code rate R →1 that achieve the vanishing output error rates on the binary symmetric channels with transition error probability p → 0. These codes have a substantially smaller redundancy order (1 − R)n than do other known high-rate codes, such as Reed-Muller (RM) or BCH codes. The construction is explicit and has complexity of order nlog n. We also design asymptotically optimal low-rate codes that achieve the vanishing output error rates if p → 1/2.