利用级联技术提高嵌套格码的性能
Improving the Performance of Nested Lattice Codes Using Concatenation
摘要:
编码理论中的一个基本问题是设计一种有效的编码方案,以实现加性白高斯(AWGN)信道的容量。这篇短文的主要目的是指出,通过在一个适当的有限域上级联一个实现容量的嵌套格码与一个合适的高速率线性码,我们可以实现具有多项式编码和解码复杂度的AWGN信道的容量。具体来说,我们表明,使用内部构造A格码和外部里德-所罗门码,我们可以获得的容量实现码的编码和解码的复杂性增长为$O(N^2)$,而错误的概率呈指数衰减在$N$,其中$N$表示块长度。用扩展码代替外部Reed-Solomon码有助于进一步将解码复杂度降低到$O(N\log^2N)$。这也给了我们一个配方转换为高斯信道的高复杂度嵌套格码的低复杂度级联码没有任何损失的渐近速率。作为例子,我们描述多项式时间编码方案的窃听信道,和计算和转发计划计算整数线性组合的消息。
英文摘要:
A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the capacity of the additive white Gaussian (AWGN) channel. The main objective of this short note is to point out that by concatenating a capacity-achieving nested lattice code with a suitable high-rate linear code over an appropriate finite field, we can achieve the capacity of the AWGN channel with polynomial encoding and decoding complexity. Specifically, we show that using inner Construction-A lattice codes and outer Reed-Solomon codes, we can obtain capacity-achieving codes whose encoding and decoding complexities grow as $O(N^2)$, while the probability of error decays exponentially in $N$, where $N$ denotes the blocklength. Replacing the outer Reed-Solomon code by an expander code helps us further reduce the decoding complexity to $O(N\log^2N)$. This also gives us a recipe for converting a high-complexity nested lattice code for a Gaussian channel to a low-complexity concatenated code without any loss in the asymptotic rate. As examples, we describe polynomial-time coding schemes for the wiretap channel, and the compute-and-forward scheme for computing integer linear combinations of messages.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。