论文标题
通用极性代码的列表解码
List Decoding of Universal Polar Codes
论文作者
论文摘要
提出了通用极性代码的列表解码方案。我们的方案适用于Sasoglu和Wang首先引入的通用极性代码，并将其推广到作者带有内存的过程。这些代码基于不同极性变换的串联：一系列“慢”变换和Arikan的原始“快速”变换。列表解码是在快速变换的背景下以前介绍的。但是，缓慢的变换明显不同，需要新的技术和数据结构。我们显示，使用空间复杂性$ o（\ Mathcal {l} \ cdot n）$和时间复杂度$ o（\ Mathcal {l} \ cdot n \ log n）$，可以使用列表解码，其中$ n $是总体blocklength和$ \ natercal {l} $是列表的尺寸。
A list decoding scheme for universal polar codes is presented. Our scheme applies to the universal polar codes first introduced by Sasoglu and Wang, and generalized to processes with memory by the authors. These codes are based on the concatenation of different polar transforms: a sequence of "slow" transforms and Arikan's original "fast" transform. List decoding of polar codes has been previously presented in the context of the fast transform. However, the slow transform is markedly different and requires new techniques and data structures. We show that list decoding is possible with space complexity $O(\mathcal{L} \cdot N)$ and time complexity $O(\mathcal{L} \cdot N \log N)$, where $N$ is the overall blocklength and $\mathcal{L}$ is the list size.
